3 ms·
> since all machines are Turing-complete No real computer is Turing-complete, since it has only a finite amount of memory.
by wolfgke 9y ago
> since all machines are Turing-complete
No real computer is Turing-complete, since it has only a finite amount of memory.