Two-State, Three-Symbol Turing Machine is Universal
This entry was posted on 10/24/2007 11:47 AM and is filed under Computation and Logic.
Wolfram's
contest for proving (or disproving) whether a particular 2-state, 3-symbol (or color) Turing Machine has been won by a 20-year old engineering student from the UK.
Link to write-up in Nature
here.