![[Classes of] fast algorithms](/nks/notes/notes-12-8--classes-of-fast-algorithms/thumb.png "[Classes of] fast algorithms")
![[Computational complexity of] finding outcomes](/nks/notes/notes-12-8--computational-complexity-of-finding-outcomes/thumb.png "[Computational complexity of] finding outcomes")
![Functions [computed by Turing machines]](/nks/notes/notes-12-8--functions-computed-by-turing-machines/thumb.png "Functions [computed by Turing machines]")
![Growth rates [of halting times]](/nks/notes/notes-12-8--growth-rates-of-halting-times/thumb.png "Growth rates [of halting times]")
![History [of computational complexity theory]](/nks/notes/notes-12-8--history-of-computational-complexity-theory/thumb.png "History [of computational complexity theory]")
![History [of undecidability]](/nks/notes/notes-12-8--history-of-undecidability/thumb.png "History [of undecidability]")
![Implementation [of TM cellular automaton]](/nks/notes/notes-12-8--implementation-of-tm-cellular-automaton/thumb.png "Implementation [of TM cellular automaton]")
![[Intractability in] systems of limited size](/nks/notes/notes-12-8--intractability-in-systems-of-limited-size/thumb.png "[Intractability in] systems of limited size")
![Longest halting times [in Turing machines]](/nks/notes/notes-12-8--longest-halting-times-in-turing-machines/thumb.png "Longest halting times [in Turing machines]")
![Lower bounds [on computational complexity]](/nks/notes/notes-12-8--lower-bounds-on-computational-complexity/thumb.png "Lower bounds [on computational complexity]")
![[NP completeness in] natural systems](/nks/notes/notes-12-8--np-completeness-in-natural-systems/thumb.png "[NP completeness in] natural systems")
![[One-sided] Turing machines](/nks/notes/notes-12-8--one-sided-turing-machines/thumb.png "[One-sided] Turing machines")
![Properties [of example Turing machines]](/nks/notes/notes-12-8--properties-of-example-turing-machines/thumb.png "Properties [of example Turing machines]")
![Satisfiability [emulating Turing machines]](/nks/notes/notes-12-8--satisfiability-emulating-turing-machines/thumb.png "Satisfiability [emulating Turing machines]")
![[Turing] machine 1507](/nks/notes/notes-12-8--turing-machine-1507/thumb.png "[Turing] machine 1507")
![[Turing] machine 600720](/nks/notes/notes-12-8--turing-machine-600720/thumb.png "[Turing] machine 600720")
![[Undecidability in] natural systems](/nks/notes/notes-12-8--undecidability-in-natural-systems/thumb.png "[Undecidability in] natural systems")
[Computational complexity of] finding outcomes
Computational complexity theory
Functions [computed by Turing machines]
Growth rates [of halting times]
History [of computational complexity theory]
Implementation [of TM cellular automaton]
[Intractability in] systems of limited size
Longest halting times [in Turing machines]
Lower bounds [on computational complexity]
Non-deterministic Turing machines
[NP completeness in] natural systems
Properties [of example Turing machines]
Satisfiability [emulating Turing machines]
Undecidability in cellular automata
[Undecidability in] natural systems