Two-State, Three-Symbol Turing Machine is Universal

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.

2 Comments

Comments are closed.