Turing machine: Be familiar with the structure and use of Turing machines that perform simple computations. 62 Know that a Turing machine can be viewed as a computer with a single fixed program, expressed using: • a finite set of states in a state transition diagram • a finite alphabet of symbols • an infinite tape with marked-off squares • a sensing read-write head that can travel along the tape, one square at a time. One of the states is called a start state and states that have no outgoing transitions are called halting states. Exam questions will only be asked about Turing machines that have one tape that is infinite in one direction. Understand the equivalence between a transition function and a state transition diagram. Be able to: • represent transition rules using a transition function • represent transition rules using a state transition diagram • hand-trace simple Turing machines. Be able to explain the importance of Turing machines and the Universal Turing machine to the subject of computation. Turing machines provide a (general/formal) model of computation and provide a definition of what is computable.

Quick explanation

Turing machine: Be familiar with the structure and use of Turing machines that perform simple computations. 62 Know that a Turing machine can be viewed as a computer with a single fixed program, expressed using: • a finite set of states in a state transition diagram • a finite alphabet of symbols • an infinite tape with marked-off squares • a sensing read-write head that can travel along the tape, one square at a time. One of the states is called a start state and states that have no outgoing transitions are called halting states. Exam questions will only be asked about Turing machines that have one tape that is infinite in one direction. Understand the equivalence between a transition function and a state transition diagram. Be able to: • represent transition rules using a transition function • represent transition rules using a state transition diagram • hand-trace simple Turing machines. Be able to explain the importance of Turing machines and the Universal Turing machine to the subject of computation. Turing machines provide a (general/formal) model of computation and provide a definition of what is computable

• This point belongs to A model of computation, especially Turing machine.
• You need to be able to turing machine: Be familiar with the structure and use of Turing machines that perform simple computations. 62 Know that a Turing machine can be viewed as a computer with a single fixed program, expressed using: • a finite set of states in a state transition diagram • a finite alphabet of symbols • an infinite tape with marked-off squares • a sensing read-write head that can travel along the tape, one square at a time. One of the states is called a start state and states that have no outgoing transitions are called halting states. Exam questions will only be asked about Turing machines that have one tape that is infinite in one direction. Understand the equivalence between a transition function and a state transition diagram. Be able to: • represent transition rules using a transition function • represent transition rules using a state transition diagram • hand-trace simple Turing machines. Be able to explain the importance of Turing machines and the Universal Turing machine to the subject of computation. Turing machines provide a (general/formal) model of computation and provide a definition of what is computable.
• Use the linked flashcards and practice questions to check recall, then practise applying the idea in an exam-style answer.