3 ms·
Those "Turing machines" are really finite state machines, because any machine so constructed has finite memory, unlike Turing machines which have infinite memor
by p-e-w 4y ago
Those "Turing machines" are really finite state machines, because any machine so constructed has finite memory, unlike Turing machines which have infinite memory.
But you are correct in the sense that software engineering has adopted an alternative definition of "Turing machine", where any computation system with (in principle) arbitrarily large memory counts as a TM.
- Nomentatus 4y agoAs much paper as you can find, for the paper tape memory. Arbitrarily large. Thanks for stating the software engineering definition, and clearly. But I've heard software types use the term for machines with finite memory.