Close

FSM

A project log for The Turing Computer plays Busy Beaver III

Now we are pushing the boundaries of computing down. Busy Beaver? Refer to https://en.wikipedia.org/wiki/Busy_beaver

agpcooperagp.cooper 10/02/2017 at 02:430 Comments

Finite State Machine (FSM)

I have knocked up a FSM version of the Turing machine:


It does not look much but here is the EasyEDA version that includes the Flash ROM:


Yes that is only seven chips. I have also discovered the 72HC273.

FSM Design

I have been looking at FSM design and found these lecture notes (some students have all the fun!):

https://www.cs.umd.edu/class/spring2003/cmsc311/Notes/Seq/impl.html

They step through the design of a FSM as shown above. The reason I was looking was that 1.5M transistor ROM is cheating for a Turing Machine. As the lecturer says, you can always replace the ROM with combinational logic.

The other reason I was looking is that this machine would be a good target for a Relay Computer. I found a D-Type Flip Flop (that does not use diodes) (source: http://relaysbc.sourceforge.net/circuits.html). Here I have set the D-Type Flip Flop as a counter:

The relay model has been set up to match the Takamisawa A-5W-K relays I have.

AlanX

Discussions