3 ms·
> They got Turing completeness in just the MMU. Since the amount of adressable memory on any CPU is finite, while a Turing machine needs in infinite band of me
by wolfgke 8y ago
> They got Turing completeness in just the MMU.
Since the amount of adressable memory on any CPU is finite, while a Turing machine needs in infinite band of memory, such claims of Turing-completeness of processors or in this case the MMU are clearly fraudulent.
Only an abstract mathematical model can be Turing-complete - there exists no physical realization of a Turing-complete system/Turing machine and there will never be.
- Sharlin 8y agoThis is completely pointless pedantry. Everybody knows that, and nobody bothers to type "Turing-complete (up to memory constraints)" all the time. Real mathematicians do this all the time, taking shortcuts with the understanding that they could phrase it completely rigorously if it were necessary.