Re: Perl Quiz of the Week #24 (Turing Machine simulation)

The earliest Turing Machines were implemented on manual typewriters,
where '1' and 'l' were fungible. I was maintaining this tradition.

Well, actually, no, I just goofed. Jon's right -- that program should produce:

hel1o_world

On Wed, 15 Sep 2004 15:24:46 -0700, Jon Ericson
<[email protected]> wrote:
> Zed Lopez <[email protected]> writes:
> 
> > If helloworld.tm contains:
> >
> >         s0 _ s1 h R
> >         s1 _ s2 e R
> >         s2 _ s3 l R
> >         s3 _ s4 1 R
> >         s4 _ s5 o R
> >         s5 _ s6 _ R
> >         s6 _ s7 w R
> >         s7 _ s8 o R
> >         s8 _ s9 r R
> >         s9 _ s10 l R
> >         s10 _ s11 d R
> >
> > then
> >
> >         tm.pl helloworld.tm
> >
> > should output:
> >
> >         hello_world
> 
> Not quite. ;-)
> 
>   $ ./tm.pl helloworld.tm
>   hel1o_world