The Turing Machine (AQA A-Level Computer Science): Flashcards

📚Flashcards
The Turing Machine
Sign up to keep revising.Create a free account to study more flashcards and track your progress.

Practise the cards

10 cards from this deck

Show

Turing machine definition

Theoretical model of computation

Turing machine creator & year

Alan Turing in 1936

Three components of a Turing machine

Finite state machine, tape, read/write head

Role of FSM in Turing machine

Control unit/brain that makes decisions

Turing machine tape characteristics

Theoretically infinite memory divided into cells

Three operations of read/write head

Read symbol, write symbol, move left or right

Halting state purpose

Stops machine's operation when computation is complete

Halting state symbol in diagram

Double circle

Transition function definition

Algorithm encoded as rules specifying machine behaviour

Universal machine purpose

Single machine that can simulate any other Turing machine

Join 100,000+ A-Level students studying Flashcards with us.

Select your subjects, and get access to A+ resources today.