Alex Smith (The Simplest Universal Computer Proof contest winner)
Template:ActiveDiscuss Alexander Ian Smith (born April 15, 1987 in Birmingham), an undergraduate studying electronic and computer engineering at the University of Birmingham, UK,[1] is known for winning the Stephen Wolfram's research prize in October 2007 for a proof that a particular 2,3 Turing machine is the simplest Universal Turing machine possible.
Smith's proof was subsequently demonstrated to be fundamentally flawed by Stanford University's Vaughan Pratt[2].
Alex Smith grew up in Birmingham, attending King Edward VI Five Ways, and was an alternate for the UK International Mathematical Olympiad team. His parents are both teachers at University of Birmingham.
Although at first he thought that the candidate proposed by Stephen Wolfram was not universal because its behavior seemed to him too simple to be capable to be universal Turing machine and only a little bits of more complicated behavior made him change his mind, he eventually devised a formal proof of the proposition that the particular Turing machine is indeed universal,[3] however this was subsequently proved to be incorrect.
References
See also
Further reading
- Student snags maths prize, Nature, Published online 24 October 2007.
- College Kid Proves That Wolfram's Turing Machine is the Simplest Universal Computer, Wired Science, Published online 24 October 2007.
- Prize Announcement and Alex Smith's original proof.
- Simplest 'universal computer' wins student $25,000, New Scientist, Published online 24 October 2007.
- The Wolfram Prize and Universal Computation: It's Your Problem Now, Dr. Dobbs Journal, Published online 22 October 2007.
- Wolfram, S. A New Kind of Science. Wolfram Media, 2002, page 709.[1]
- 2,3 Turing Machine Research Prize.
- A New Kind of Science Author Pays Brainy Undergrad $25,000 for Identifying Simplest Computer by J.R. Minkel, Scientific American, October 25, 2007.