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

On Wed, 15 Sep 2004 14:09:09 -0400, John Macdonald wrote:
> Other additions that would be useful (but not strictly
> necessary) would be:
> 
> - allow a wildcard or class match to the symbol being examined

This makes it harder to show that you have a finite list of symbols

> - have a "don't change the current symbol" as an alternative
>   to always specifying an explicit replacement symbol

Ditto

> - as well as l and r to move the position left and right,
>   permit 0 to stay in place

Then it stops being a Turing machine

-- 
	Peter Haworth	[email protected]
Nigel Hamilton: I'll have some of what [Richard Stallman]'s smoking.
Jonathan Peterson: Might be tricky. I'm pretty sure he's smoked all of it.
		That's the only possible explanation for the guy.