4 ms·
No actual implementation of a language is Turing complete because the universe is finite, but a language specification could be. I think the argument here is th
by burkaman 2y ago
No actual implementation of a language is Turing complete because the universe is finite, but a language specification could be. I think the argument here is that even if you had a computer with infinite memory, if you implemented C99 per the specification it would not be Turing complete.
- olliej 2y agoThe literal definition of Turing completeness means that if you can use an environment to implement a Turing machine, the environment is necessarily Turing complete.
- cowboylowrez 2y agoyeah, couldn't the "tape" just be the hard drive accessed with the 64 bit file operations?