
Ben R. answered 07/09/19
Tutor
New to Wyzant
MC CS, Rutgers
It's an abstraction for the most general class of computing devices that is useful in analyzing certain algorithms and certain problems in computability and complexity. It's the most capable of the three classes of abstract machines:
- Finite State Machines, which can recognize regular expression grammars (https://en.wikipedia.org/wiki/Finite-state_machine)
- Push-down Automata, which can recognize context-free grammars problems (https://en.wikipedia.org/wiki/Pushdown_automaton)
- Touring Machines, which can solve any solvable problem in the domain of human algorithms (https://en.wikipedia.org/wiki/Turing_machine)