Re: Converter TM -> Rule110

From: Kent Paul Dolan (xanthian_at_well.com)
Date: 03/05/04

Date: Thu, 4 Mar 2004 23:33:58 +0000 (UTC)

"André Betz" <mail@andrebetz.de> wrote:

> Hi,
> I have written a converter in Java which converts from a Turing Machine
> description to CA Rule 110 configuration.

> so if you are interested feel free to download this file.

Does that in and of itself provide a proof that rule 110
supports Turing complete computation? It should, I would think.

xanthian.

-- 
Posted via Mailgate.ORG Server - http://www.Mailgate.ORG

Relevant Pages

Re: Arthur ODwyer on the feasibility of simulating a Turing Machine
... For any Turing Machine there exists at least one configuration which would ... We may call this square the scanned square. ... altering its m-configuration the machine can effectively remember some of ...
(comp.programming)
Converter TM -> Rule110
... I have written a converter in Java which converts from a Turing Machine ... description to CA Rule 110 configuration. ...
(comp.theory)
Re: The proof that I was referring to is on the website
... > This is much closer to the true nature of a Turing Machine. ... C++, Java, and assembly are all Turing complete languages, so ...
(sci.logic)
Re: The proof that I was referring to is on the website
... > This is much closer to the true nature of a Turing Machine. ... C++, Java, and assembly are all Turing complete languages, so ...
(comp.theory)
Turing Machine to Train Sets Converter
... I've written a converter which transforms a turing machine description ... into a line section (see also Chalcraft Train Sets). ...
(comp.theory)