Shared note
Software · L5 · Computability Theory
Turing machines, the Church–Turing thesis, the halting problem via diagonalization, many-one reducibility, and Rice's theorem.
We use privacy-friendly product analytics (no session recording, PII masked) to improve OpenStem. Load analytics? Privacy Policy