4 ms·

> Probably why the stack based turing machine is academically important. A Turing machine is not stack-based, but tape-based. A pushdown automaton (PDA) is sta

by q-big 5y ago

> Probably why the stack based turing machine is academically important. A Turing machine is not stack-based, but tape-based. A pushdown automaton (PDA) is stack-based.

imode 5y ago
Two stacks make an automaton Turing Complete. Which is an interesting result.
bear8642 5y ago
Although turing machine tape emulatable via 2 stacks