The Wolfram Prize
I've had on my "to blog about" list for months the Wolfram Prize to prove that a certain 2,3 Turning Machine is universal.
Well, in the mean time, Alex Smith has gone and won the prize. I'll still blog about the theory behind the prize, though, and maybe eventually say some things about the proof (pdf).
Comments (2)
James Tauber on Nov. 4, 2007:
The technical details of the competition at http://www.wolframscience.com/prizes/tm23/technicaldetails.html have an entire section on the definition of universality that does touch on the subjective nature of it.
The issue seems to be just how much the "compiler" is allowed to do. As the document says: "if too much goes into the construction of the program, then computation can be done there, rather than in the system itself."
The issue seems to be just how much the "compiler" is allowed to do. As the document says: "if too much goes into the construction of the program, then computation can be done there, rather than in the system itself."
Add a Comment
Created: Nov. 4, 2007
Last Modified: Nov. 4, 2007
Author: jtauber
Last Modified: Nov. 4, 2007
Author: jtauber
Doug Napoleone on Nov. 4, 2007:
http://forum.wolframscience.com/showthread.php?s=&threadid=1472