New proofs and results

From InterSciWiki

On October 2007, it was announced that Alex Smith, a student in electronics and computing at the University of Birmingham (UK), won the Wolfram prize for proving that the (2,3) Turing machine is universal Smith's "compiler", however, tends to produce code that is very inefficient and astronomically large, so whether there exist more efficient (2,3) Turing machine codings is an open question. Another Wolfram prize in the doing?