4 ms·
If a language only allows you to specify programs with bounded memory usage, then it will fail to be Turing-complete.
by Chinjut 12y ago
If a language only allows you to specify programs with bounded memory usage, then it will fail to be Turing-complete.