|
Fri Jan 4 15:36:29 EST 2008
update on 2,3 turing machine
--
This all happened at the end of October, but I am just getting
around to checking out the results - and the fallout of the pro-
posed solution.
I first posted about the challenge in:
http://www.0x743.com/.vee/1179247100.2007-05-15T12:38:20.html
On October 24, 2007 it was announced that someone had shown the
2,3 TM to be universal. Links to the announcement and "proof"
follow:
announcement (wolfram.com)
proof (wolframscience.com)
However, a few days later there was a dispute with the proof. I
am not sure of the current situation, but it doesn't seem to be
resolved as of yet. On one hand, there is a computer scientist
making a theoretical argument then on the other there is Wolfram,
et al. thumbing their noses at the guy. I guess we'll see when
and if the proof ever gets peer reviewed.
In the meantime, as good of a place as any to follow the saga is
Wikipedia:
universality of the 2,3 TM (wikipedia.com)
As a side note, the person refuting the proof is Vaughan Pratt,
who seems pretty well qualified to do so:
http://boole.stanford.edu/pratt.html
--
Powered by vee
Copyright © 2006-2008
|
|