27 Mar
2010
27 Mar
'10
9:11 p.m.
Tony Duell wrote:
If I was doing it, I'd use a RAM to hold a lookup
table (say 64K, with
the 16 address lines being the 8 bits of the current state and the 8 bits
of the character from the 'tape'), Output from the RAM is the next state
number (8 bits), character to write (8 bits), whether to wite the
character to the 'tape', incremebnt/decrement 'tape postion'. Then an 8
bit latch to store the current state, a large RAM and address counter to
simulate the 'tape' and a small amount of control logic.
-tony
This is more fun for a demo machine -- Universial Turing Machine.
http://www.rdrop.com/~half/General/UTM/index.html
It seems both the program and states are recorded on the tape.
The Turning State table is fixed for just *ONE* instruction set -
Everything ! (note still single tasking).
Ben.