Enrichment & Ancillary
JFLAP tool and instructions
OneHash Site and Tooling
- 1#
- TRM Interpreter repository (Download,
make, and run)
Lessons for TRM
- Getting Started w/RM
- (You may skip)
- Programs 4 Programs
- Self-Rep
Supplementary Videos
- make and
Makefiles - Big O notation
- Big O notation (again)
- P v. NP (High level gist, 10m)
Additional / ancillary reading
- Fast implementation of DFAs w/Haskell and C.
- Why theory pops up in practice
- DDOS through Regex, in practice
- regex are not the appropriate choice
- More on the Ackermann Function + History
- Quine-McCluskey Algorithm, Visualized
- Automatically generating /conjectures/
- DeBruijn and Automath: the first proof checker
- Galactic Algorithms
P, NP, SAT
- Results of the SAT Solver Competition at the 2018 Computational Logic Olympic Games
- SAT/SMT by Example As it suggests, scores of examples. Also a good place to start. SAT != SMT.
- CNF, DNF Normalization, Visualized
- It’s tough to organize a pub crawl
Other Sipser-based courses
Other non-Sipser based courses
Meta
- Why we study proofs
- Starting with a Theory of Computation course
- The history of the theory of computation
- Teaching theory of computation through search
- Philosophy of Computer Science (Draft text)
- Keeping logic in the trivium of computer science: a teaching perspective
- Turing did not invent the computer
Ancillary
- Chiang’s short story “Seventy-two Letters” (Audio version)
- Logicomix (It’s a comic about Russell and early 20th century mathematical logic. ᕕ( ᐛ )ᕗ)
- Chiang’s “Division by Zero” (a story about ex-falso quodlibet)
- Russell’s “The Metaphysician’s Nightmare” (a story about the troubles with negation).
- Dr. Spencer’s Mantra for the relief of anxiety that accompanies attempts to prove theorems