Turing machine
abstract computation model; mathematical model of computation that defines an abstract machine which manipulates symbols on a strip of tape according to a table of rules
quantum Turing machine
model of quantum computation
read-only Turing machine
Turing machine that cannot write to its input tape
Symmetric Turing machine
graph Machine
Alternating Turing machine
abstract computation model
busy beaver
a halting, binary-alphabet Turing machine which writes the most 1s on the tape, using only a limited set of states
decider
Turing machine that always halts for any input
non-deterministic Turing machine
may have a set of rules that prescribes more than one action for a given situation; state and tape symbol no longer uniquely specify things; rather, many different actions may apply for the same combination of state and symbol
universal Turing machine
turing machine that can simulate an arbitrary Turing machine on arbitrary input by reading both the description of the machine to be simulated as well as the input thereof from its own tape