3 ms·
... Yes? What are you trying to say? Did you go and lookup what a Turing machine is? Or read the section entitled "Non-mathematical usage"?
by uxp8u61q 3y ago
... Yes? What are you trying to say? Did you go and lookup what a Turing machine is? Or read the section entitled "Non-mathematical usage"?
- kweingar 3y agoYou said > It doesn't make sense to say that a bunch of operations are or are not Turing complete. and the article’s first sentence says that a “system of rules” such as a computer’s instruction set can be Turing complete. The article matches my understanding, which is that Turing completeness is a property describing the expressive power of a bunch of operations. You don’t need a computer with infinite memory, or even any physical computer at all, for a bunch of operations to be Turing complete.