Turing Machines

Home > Languages > Formal Language > Recursively Enumerable Languages > Turing Machines

Turing machines are theoretical computing devices used to model the behavior of algorithms. They consist of an infinite tape and a finite set of rules.