A Turing machine is a formal model of computation that manipulates symbols according to rules on an abstract tape. It provides a foundational framework for studying computability, algorithms, and the limits of what machines can compute.
A mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, it is capable of implementing any algorithm.