[PRL] the simplest universal turing machine

Carl Eastlund cce at ccs.neu.edu
Fri Oct 26 19:24:44 EDT 2007


It always surprises me how worked up the Wolfram Research folks get
over finding new, small, Turing-complete models of computation.  I
always thought they were a dime a dozen.  In any event, if they're
impressed by a 2-state, 3-color Turing machine, someone should show
them the X combinator.

On 10/26/07, Dimitris Vardoulakis <dimvar at ccs.neu.edu> wrote:
> http://blog.wolfram.com/2007/10/the_prize_is_won_the_simplest.html
>

-- 
Carl Eastlund



More information about the PRL mailing list