[Computational Complexity] Wolfram Prize won!- There IS a (2,3)-UTM
- Recall that the Wolfram Prize which I blogged about here, was given to anyone who can determine if a certain Turing Machine was universal. It is now known that YES that machine IS universal.
Congrads to Stuart Kurtz, Lance Fortnow, and Kathryn Cramer, Jon Katz, and Katrina LaCurts- NOT for winning the prize but for being the first ones to tell me who won the prize so I could post it. For that they win... a mention in this blog.
Here are some websites about it, most of them emailed to me by Kathryn Cramer.
- write up in nature
- Stephen Wolfram's blog!
- Smith's 44 page proof!
- New Scientist Story
- Alex Smith's Photo!
- Geomblog scooped me here
- Live Journal
BACK TO BILL:
How important is the result? Alex Smith got $25,000 for it. The market has spoken, the result is important.
Posted By GASARCH to Computational Complexity at 10/25/2007 12:23:00 PM