ConceptEngineering
Truth table
A table that shows the logical output of a circuit for each possible input combination.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Logic gates2Logical statement2Binary logic1Boolean algebra1Boolean function1Boolean logic1Logical connectives1Proposition symbols1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
4Each in their own terms, from the easiest level.
Vicky Neale
A systematic way to catalog all possible truth values of a logical statement based on the truth values of its components.Onur Mutlu
A truth table specifies the operation of a circuit by enumerating all possible combinations of the inputs.Brian Yu
A table that demonstrates what a logical connective means when attached to propositional symbols or sentences.Ryan O'Donnell
A listing of all possible input combinations to a Boolean function and their corresponding output values.
Lectures that assume it
14The first 12 are shown.
- Introduction and Proofs
- Digital Design and Computer Architecture - L3: Sequential Logic
- Sequential Logic II, Labs, Verilog
- Stream Ciphers, Random Numbers and the One Time Pad
- Cook-Levin Theorem
- Revealing XOR-patterns I
- Digital Design and Computer Architecture: Problem Solving II (ETH Zürich, Spring 2025, Lecture 27)
- Digital Design and Computer Architecture: Problem Solving VI (ETH Zürich, Spring 2025, Lecture 31)
- Quantum Algorithms Synthesis I: The Hadamard Transform
- Deobfuscation of a Real World Binary Obfuscator
- Digital Design and Computer Architecture: Problem Solving I (ETH Zürich, Spring 2025, Lecture 26)
- Quantum Algorithms Synthesis II: Grover's Search & Circuit SAT
Connections
29The lectures that define it or assume it, and the concepts next to it.
Concepts9
Show 3 moreShow fewer
Lectures20
- The Fourier Expansion and Basic Formulas
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Binary Relations, Partitions & Equivalence Relations
- Natural Numbers, Well-Ordering & Mathematical Induction
- Digital Design and Computer Architecture - L1: Intro: Fundamentals, Transistors, Gates
- Digital Design and Computer Architecture - L2: Combinational Logic
Show 14 moreShow fewer
- Introduction and Proofs
- Digital Design and Computer Architecture - L3: Sequential Logic
- Sequential Logic II, Labs, Verilog
- Stream Ciphers, Random Numbers and the One Time Pad
- Cook-Levin Theorem
- Revealing XOR-patterns I
- Digital Design and Computer Architecture: Problem Solving II (ETH Zürich, Spring 2025, Lecture 27)
- Digital Design and Computer Architecture: Problem Solving VI (ETH Zürich, Spring 2025, Lecture 31)
- Quantum Algorithms Synthesis I: The Hadamard Transform
- Deobfuscation of a Real World Binary Obfuscator
- Digital Design and Computer Architecture: Problem Solving I (ETH Zürich, Spring 2025, Lecture 26)
- Quantum Algorithms Synthesis II: Grover's Search & Circuit SAT
- The Polynomial Time Hierarchy
- Quasilinear Cook–Levin Theorem