Why the F21 is such a great idea! =)
- To: "MISC@xxxxxxxxxxxxxxxxxxxx" <MISC>, "f-cpu@xxxxxxxxxxx" <f-cpu@xxxxxxxxxxx>
- Subject: Why the F21 is such a great idea! =)
- From: Alan Grimes <alangrimes@xxxxxxxxxxxxx>
- Date: Fri, 16 Jul 1999 11:46:23 -0700
- Organization: Nanosoft; Software That Thinks.
- Reply-To: alangrimes@xxxxxxxxxxxxx
y0,
I've been reeding some in one of my musty old books and I came across this.
Finite state machines only handle Regular Grammars!
A stack machine. (Pushdown Automaton) allows the use of a "Context Free gramar"
(whatever that is).
A Turing machine is the FSM given unlimited memory.
A Moore machine is an enhanced/ more efficient Turing machine that uses a
pushdown automaton instead of a FSM as its controller.
The question I am eggzamining today is: Is there anything beyond that? What is
the next step? The Celular Automata answer is to stack an unlimited number of
Finite State Automata. Where ecah cell on turing's tape becomes its own machine.
=P Any ideas? Comments? Flames?
--
Pyramid schemes are illegal.
Social Security is a pyramid scheme.
users.erols.com/alangrimes/
