Theoretical Computer Science Explained
Theoretical computer science: 27.5 Proposition. ⊢K+(A3) □(A ↔ B) → □(F(A) ↔ F(B)). 27.16 Lemma. w ⊨ □(p ↔ A) → □(□Cᵢ(p) → □Cᵢ(Hᵢ)). Also theoretical computer science: Figure 3-1. A Turing machine.
The meme contrasts intimidating formal logic notation with a very simple diagram of a box moving along a tape, labeled as a Turing machine. The joke is that theoretical computer science includes both highly abstract mathematical proofs and the basic conceptual machines used to explain computation. It is sent as a reaction to the surprising breadth or intimidating mixture of topics in computer science.
- @dev_meme / 4851 2022-09-08
- @dev_meme / 5541 2023-09-29
- Type
- image
- Size
- 640×634 · 37.6 KiB
- Mood
- absurd, sarcastic
- Language
- en
- Added
