3 ms·
Turing completeness is a property of a language, not an implementation. There are programming languages where a bound on memory is not part of the spec. Those a
by penteract 5y ago
Turing completeness is a property of a language, not an implementation. There are programming languages where a bound on memory is not part of the spec. Those are Turing complete even if there can be no perfect implementation of them.