Theory of Computation
Automata, computability, and language hierarchies.
Coming soon: DFA/NFA notes and proofs.
Computing Canon
Theoretical tools translated into engineering instincts. Start with the fundamentals and layer on more specialized systems knowledge.
Automata, computability, and language hierarchies.
Coming soon: DFA/NFA notes and proofs.
Complexity classes, reductions, and hardness.
Coming soon: P vs NP primers and problem maps.
Graph theory, combinatorics, and counting.
Coming soon: discrete proofs and identities.
Specification, model checking, and correctness proofs.
Coming soon: invariants and temporal logic.
Type systems, semantics, and interpreters.
Coming soon: lambda calculus and type soundness.
Entropy, compression, and channel capacity.
Coming soon: coding theory notes.
Turing machines, RAM models, and circuits.
Coming soon: model comparisons and limits.
Propositional logic, predicates, and proof systems.
Coming soon: resolution and SAT basics.
Geometric algorithms and spatial complexity.
Coming soon: convex hull and line sweep.
Search, knowledge representation, and reasoning.
Coming soon: agents and planning notes.