Hi,
On Fri, Apr 23, 2004 at 08:26:35PM +1000, Herbert Xu wrote:
> Given any finite string of bits, you can construct a Turing machine in a
> deterministic way and execute it.
Sorry, I can't follow here. What do you mean by "construct a
Turing machine in a deterministic way"? What would be the Turing
machine for
101011110100000000000000110101000000000000111010100000001
and why do you need the bit string given to construct the Turing machine?
Confused,
Jochen
--
http://seehuhn.de/
Attachment:
signature.asc
Description: Digital signature