Turing machines

[96/67%]

Subtopics

Constructing a Turing machine for a string-processing function[22/82%]
Constructing a Turing machine for an arithmetic function[16/88%]
Turing machine variants and equivalence[13/31%]
Tracing a Turing machine's configurations[12/58%]
Unrestricted (type-0) grammars[11/36%]
Composing Turing machine programs and estimating their running time[9/100%]
Equivalence of Turing computability and partial recursiveness[6/100%]
Universal Turing machine[4/0%]
Church-Turing thesis[2/50%]
Properties following from the formal definition of a Turing machine[1/100%]