ConceptTheory & Algos
State machine
A formal model consisting of states, a start state, and transitions to model the possible operations and changes in a system.
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.
Relation1Sets1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
13The first 12 are shown.
- Raft Consensus Algorithm (User Study Lecture)
- Digital Design and Computer Architecture - L3: Sequential Logic
- The Raft Consensus Algorithm: Leader Election & Log Replication
- Raft Log Compaction, Persistence & Linearizability (Part 2)
- Cache Consistency: Frangipani
- Primary-Backup Replication & VMware FT
- Thinking Above the Code
- Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
- Turing Machines
- Consensus & Fault Tolerance — Raft (Part 1)
- The DEC VT100 Terminal: An 8-Bit Computer Deep Dive
- Functional Design Patterns
Connections
20The lectures that define it or assume it, and the concepts next to it.
Concepts6
Lectures14
- Number Theory I
- Raft Consensus Algorithm (User Study Lecture)
- Digital Design and Computer Architecture - L3: Sequential Logic
- The Raft Consensus Algorithm: Leader Election & Log Replication
- Raft Log Compaction, Persistence & Linearizability (Part 2)
- Cache Consistency: Frangipani
Show 8 moreShow fewer
- Primary-Backup Replication & VMware FT
- Thinking Above the Code
- Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
- Turing Machines
- Consensus & Fault Tolerance — Raft (Part 1)
- The DEC VT100 Terminal: An 8-Bit Computer Deep Dive
- Functional Design Patterns
- The Graveyard of Good Ideas: Reexamining Abandoned Concepts in Computing History