SHSubjectHub

A model of computation: Turing machines

AQA 75174.4 L6A-levelLesson packSubscription
Also online

This worksheet marks itself

Set it as homework or classwork and every answer is marked as pupils go, with feedback on what they got wrong. The scores go straight into your mark book, so you can see who needs help before the next lesson.

  • 12 questions
  • 36 marks
  • about 40 minutes
  • marked instantly

Question types: short answer, matching, true or false, multiple choice.

Try it with a class, freeHow it works

Try one from this worksheet

The Turing machine shown works on binary numbers. Identify the rule that is the arrow from S1 to S2.

Pick an answer: it's marked straight away, just as your pupils would see it.

About this resource

AQA A-level Computer Science (7517) 4.4.5.1 Turing machine. C# lesson 6 of 6 in 4.4 Theory of computation: a trace-the-loop Do Now, a short key idea, a 10-challenge ladder in three sets with exact test data, two exam questions and a worksheet. Replaces aqa-7517-4-4f-turing-machines.

19 slides.

Lesson outline

  1. Do Now: trace the loop
  2. Do Now: answers
  3. Key idea: A Turing machine: tape, head and states
  4. Key idea: Two ways to write the rules
  5. Quick check: read a rule
  6. Key idea: Trace it: 1011 + 1
  7. Key idea: Why Turing machines matter
  8. Key idea: Why Turing machines matter: check your predictions
  9. Set 1: the rules and the tape in code
  10. Set 2: step, run and trace
  11. Exam question E1: the universal machine
  12. Model answer E1
Unit bundle4.4 Theory of computation · full lessons
Part of: 4.4 Theory of computation · full lessons: the whole unitEvery resource in the unit in one zip.

More from 4.4 Theory of computation · full lessons