20071026, 10:32  #1 
"Lucan"
Dec 2006
England
2×3×13×83 Posts 
Simplest universal Turing machine

20071026, 11:21  #2 
"Mark"
Apr 2003
Between here and the
2^{5}·3·67 Posts 
I believe that a similar post was put into the Uninteresting Links thread

20071026, 11:23  #3  
"Lucan"
Dec 2006
England
2×3×13×83 Posts 
Quote:
Have done http://arstechnica.com/news.ars/post...lproblem.html Deserves a separate thread methinks. (Considering the intellectual merit of some of the "Unintersting Links":)) Last fiddled with by davieddy on 20071026 at 12:13 

20071027, 13:02  #4 
"Lucan"
Dec 2006
England
2·3·13·83 Posts 
"A proof made public today illustrates that Stephen Wolfram's 2,3 Turing
machine number 596440 is a universal Turing machine." Only about 2 years ago, I was sufficiently inspired by the relevant chapter in Roger Penrose's "The Emperor's New Mind" to emulate his example Turing machine in BASIC, copied the decimal number (~10,000) digits representing his universal machine, and verified that it could implement Euclid's algorithm to find the GCD of two numbers. Any similar stories? David 
20071126, 04:59  #5 
Nov 2005
2·7·13 Posts 
Even more interesting is the simplest implementation of a Qubitusing computer. I'd wonder what the equivilent to a magnetic tape would look like  it would have to encode the Qubits for a long time to be of any use.
In actual practice, there's of course a tradeoff between simplicity and actually being practical. A <10k transistor CPU running at it's fastest speed using 45nm technology is still slow because of lag to the outside world. Anyone know of where to get a RAM module running at 4THz? ;) 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Turing test result  xilman  Science & Technology  13  20140610 12:26 
Universal Life Policies  ZetaFlux  Soap Box  16  20120527 04:09 
The cmd Turing test  cmd  cmd  113  20110206 15:46 
Simplest general purpose CPU?  nibble4bits  Puzzles  8  20080605 11:32 
ChurchTuring Thesis  Prime Monster  Math  8  20050712 05:35 