Turing Machine
 |
|
A Turing machine is a theoretical computing machine that serves as an idealized model for mathematical calculation.
Turing machine is a college-level concept that would be first encountered in a theory of computation course.
Prerequisites
| Algorithm: | An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. |
| Recurrence Relation: | A recurrence relation is a mathematical relationship expressing the members of a sequence as some combination of their predecessors. |