[tt] [FoRK] minimal universal turing machine

[Eugen Leitl]

----- Forwarded message from Rohit Khare <khare at alumni.caltech.edu> -----

From: Rohit Khare <khare at alumni.caltech.edu>
Date: Fri, 26 Oct 2007 13:51:56 -0400
To: FoRK Mailing List <fork at xent.com>
Subject: [FoRK] minimal universal turing machine
X-Mailer: Apple Mail (2.752.2)
Reply-To: Friends of Rohit Khare <fork at xent.com>

Ben Sittler: also did you see that the minimal universal turing  
machine has (apparently) been proven?
Rohit Khare: huh?
Ben Sittler: apparently a two-state three-color machine is the  
minimal one capable of universal computation
Ben Sittler: stephen wolfram set a bounty on proving or disproving it  
earlier this year, and somebody did prove it
Ben Sittler: http://blog.wolfram.com/2007/10/ 
the_prize_is_won_the_simplest.html
Ben Sittler: i foolishly spent a few minutes last night hacking  
together a simulator: http://zoehep.xent.com/~bsittler/t23.html
Rohit Khare: don't tell me you're using tables?!
Ben Sittler: yep :)
Rohit Khare: sick, sick man...
Ben Sittler: works like a charm
Ben Sittler: i insert new cells with rowspan=# of rows - 1 to grow  
the tape
Ben Sittler: otherwise i would use divs and br
Ben Sittler: which are way faster but do not give the nice layout
_______________________________________________
FoRK mailing list
http://xent.com/mailman/listinfo/fork

----- End forwarded message -----
-- 
Eugen* Leitl <a href="http://leitl.org">leitl</a> http://leitl.org
______________________________________________________________
ICBM: 48.07100, 11.36820 http://www.ativel.com http://postbiota.org
8B29F6BE: 099D 78BA 2FD3 B014 B08A  7779 75B0 2443 8B29 F6BE