Submission + - $25,000 question: Is this Turing machine universal
An anonymous reader writes: Stephen Wolfram, creator of Mathematica and author of A New Kind of Science, is offering a 25k prize to anyone who can prove or disprove his conjecture that a particular 2-state, 3-color Turing machine is universal. If true, it would be the simplest universal TM, and possibly simplest universal computational system — even simpler than rule 110. The announcement comes on the 5-year anniversary of the publication of NKS, where among other things Wolfram introduced the current reigning TM champion.
