3 ms·
I thought languages were Turing-complete, not machines. Languages don't have the problem, because they don't have to have their own memory.
by mtdewcmu 12y ago
I thought languages were Turing-complete, not machines. Languages don't have the problem, because they don't have to have their own memory.
- Chinjut 12y agoIf a language only allows you to specify programs with bounded memory usage, then it will fail to be Turing-complete.