Hacker News new | past | comments | ask | show | jobs | submit login

> 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.




Although turing machine tape emulatable via 2 stacks


Two stacks make an automaton Turing Complete. Which is an interesting result.




Consider applying for YC's Spring batch! Applications are open till Feb 11.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: