26 Mar
2010
26 Mar
'10
5:42 p.m.
Did you guys catch this:
http://aturingmachine.com/
Cool!
Randy
_________________________________________________________________
The New Busy is not the old busy. Search, chat and e-mail from your inbox.
http://www.windowslive.com/campaign/thenewbusy?ocid=PID27925::T:WLMTAGL:ON:…
26 Mar
26 Mar
6:48 p.m.
Randy Dawson wrote:
Did you guys catch this:
http://aturingmachine.com/
Cool!
Yes it is !
And a good use for a big MICRO processor chip to hold states.
- Thinking of a 'Turning computer C compiler' I saw some where on the
net.- :)
Ben.
27 Mar
27 Mar
4:18 p.m.
Randy Dawson wrote:
Using a microprocessor for soemthing like this seems almost like cheating
to me. I think we all know a mucroprocessor can simulate a truing machine
(modulo the finite amount of memory).
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
Did you guys catch this:
http://aturingmachine.com/
Cool!
Yes it is !
And a good use for a big MICRO processor chip to hold states.
8:44 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.
I think BYTE had a version like that, when they where not a PC review
magizine. Still that type of machine is better 'visible' machine than
something
you would use day to day. Any kind of memory was the problem back then,
not computing logic.
-tony
Ben.
9:11 p.m.
New subject: slashdotted - home built turing machine - II
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.
5236
days inactive
5238
days old
4 comments
3 participants
participants (3)
-
ard＠p850ug1.demon.co.uk -
bfranchuk＠jetnet.ab.ca -
rdawson16＠hotmail.com