Two-State, Three-Symbol Turing Machine is Universal Corey Maley October 24, 2007 July 9, 2016 Uncategorized ShareTweetShare 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. Previous PostSleeping News Next PostICT Theory of Mind Workshop 2 Comments marcin miłkowski October 24, 2007 at 6:25 pm 17 years ago The link to Nature is wrong… Corey October 24, 2007 at 9:27 pm 17 years ago It’s working for me; anyone else having problems? Comments are closed.
The link to Nature is wrong…
It’s working for me; anyone else having problems?