Price announcement. Some comments on it. (Courtesy of Zvi Biener.)
Wolfram Offers Prize for Proof of Universality of (2,3) Turing Machine
3 Comments
Comments are closed.
Price announcement. Some comments on it. (Courtesy of Zvi Biener.)
Comments are closed.
Just to rib Big G a little on a paper of his I just commented on, the Wolfram folks appear to say that a universal TM “emulates” any Turing machine, where Big G says that a universal TM “executes” any TM. Is that one vote for Aizawa’s skepticism?
FWIW, I wouldn’t say that a universal TM executes another TM. I would say that a universal TM executes a program that encodes another TM. I would also say that, in virtue of executing such a program, the universal TM emulates (or simulates) the other TM.
I like the typo in the post. In this case, Wolfram paid a nice price to get more publicity 😉