Simplest universal Turing machine

davieddy · 2007-10-26, 10:32

http://technology.newscientist.com/a...ent-25000.html

rogue · 2007-10-26, 11:21

I believe that a similar post was put into the Uninteresting Links thread

davieddy · 2007-10-26, 11:23

Quote:

Originally Posted by rogue

I believe that a similar post was put into the Uninteresting Links thread

Good. I thought about putting it there. Will look.

Have done
http://arstechnica.com/news.ars/post...l-problem.html

Deserves a separate thread methinks.
(Considering the intellectual merit of some of the "Unintersting Links":-))

davieddy · 2007-10-27, 13:02

"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

nibble4bits · 2007-11-26, 04:59

Even more interesting is the simplest implementation of a Qubit-using 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? ;)

2007-10-26, 10:32	#1
davieddy "Lucan" Dec 2006 England 2×3×13×83 Posts	Simplest universal Turing machine http://technology.newscientist.com/a...ent-25000.html

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Turing test result	xilman	Science & Technology	13	2014-06-10 12:26
Universal Life Policies	Zeta-Flux	Soap Box	16	2012-05-27 04:09
The cmd Turing test	cmd	cmd	113	2011-02-06 15:46
Simplest general purpose CPU?	nibble4bits	Puzzles	8	2008-06-05 11:32
Church-Turing Thesis	Prime Monster	Math	8	2005-07-12 05:35

2007-10-26, 11:21	#2
rogue "Mark" Apr 2003 Between here and the 2×3²×347 Posts	I believe that a similar post was put into the Uninteresting Links thread

2007-10-27, 13:02	#4
davieddy "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

2007-11-26, 04:59	#5
nibble4bits Nov 2005 2·7·13 Posts	Even more interesting is the simplest implementation of a Qubit-using 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? ;)