Re: Solution to QOTW #23 in language of QOTW #24

Andrew Dalke <dalke-DxsMES/F/[email protected]> Sat, 18 Sep 2004 14:46:28 -0600

Newsgroups	gmane.comp.lang.perl.qotw.discuss
Message-ID	<[email protected]>

Daniel Martin:
 > As a demonstration that turing machines can indeed do all the
 > things more convenient computer systems can, I attach a solution
 > to the "parens" problem of a few weeks ago in the turing machine
 > language of QOTW #24.

Cool!

And since it doesn't use a call stack it isn't limited to
N<500 as was my solution ... and only 120 times slower
for N = 10.  To prove it, I just generated the first few
(12) answers to N=1000 ! Only took 100,000,000 steps.


					Andrew
					dalke-DxsMES/F/[email protected]