ConceptSystems & CS
Binary representation
Representing numbers as a sum of powers of 2 scaled by either 0 or 1, matching the two-state nature of computer hardware.
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.
Base 10 numbers1Powers of 21
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
42The first 12 are shown.
- Dynamic Programming III: Parenthesization, Edit Distance, Knapsack
- Communication Networks
- Data Compression and Shannon’s Noiseless Coding Theorem
- Bit Hacks
- Graph Optimization
- Elliptic Curve Cryptography (ECC)
- Integer Models
- Deep Dive into Large Language Models: Pretraining to RLHF
- P and NP, SAT, Poly-Time Reducibility
- The Fourier Transform over Z_n
- C Programming
- Three Learning Principles
Connections
48The lectures that define it or assume it, and the concepts next to it.
Lectures43
- Loops over Strings, Guess-and-Check, and Binary
- Dynamic Programming III: Parenthesization, Edit Distance, Knapsack
- Communication Networks
- Data Compression and Shannon’s Noiseless Coding Theorem
- Bit Hacks
- Graph Optimization
Show 37 moreShow fewer
- Elliptic Curve Cryptography (ECC)
- Integer Models
- Deep Dive into Large Language Models: Pretraining to RLHF
- P and NP, SAT, Poly-Time Reducibility
- The Fourier Transform over Z_n
- C Programming
- Three Learning Principles
- Shor's Factoring Algorithm
- Digital Design and Computer Architecture: Problem Solving IV (ETH Zürich, Spring 2025, Lecture 29)
- Divide & Conquer: Van Emde Boas Trees
- Dynamic Optimality II
- On the Emergence of Representational Geometry from Natural Language Statistics
- Quanta, Symmetry, and Topology
- The DEC VT100 Terminal: An 8-Bit Computer Deep Dive
- Assembly Language & Computer Architecture
- Scratch
- Memory
- Side-Channel Attacks
- Von Neumann Model & Instruction Set Architectures
- Introduction to Hash-based Post-quantum Cryptography (PQC)
- Dwarfs of Computation in HPC Fusion Codes
- States, Logic & Complex Vector Spaces
- Computational Models: Turing Machines
- Error-Correcting Codes—Hamming Codes
- Floats and Approximation Methods
- 25 Years of Mathematical Thrills
- Data Formats & Encoding Part 2
- Python
- Instruction Set Architectures II
- SHA-3 Hash Function
- Time Complexity
- Digital Design and Computer Architecture: Problem Solving I (ETH Zürich, Spring 2025, Lecture 26)
- Assembly Programming
- Hash All The Things / Get All The Sig(s): Automatic Function Detection for Reverse Engineers
- Analysis of Boolean Functions: Applications in Social Choice
- Cybersecurity
- The Limit Is the Sky… (Or Not)? Cosmic Physics, Trusted Computing, and Hardware Exploitation