See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Theoretical model of computation
Alan Turing in 1936
Finite state machine, tape, read/write head
Control unit/brain that makes decisions
Theoretically infinite memory divided into cells
Read symbol, write symbol, move left or right
Stops machine's operation when computation is complete
Double circle
Algorithm encoded as rules specifying machine behaviour
Single machine that can simulate any other Turing machine
Select your subjects, and get access to A+ resources today.