Unit #2-01

Learning Outcome

At the end of this lesson, you will be able to:

• understand the Turing Machine

Review

• Finite State Machine

  • a machine can be in 1 of several states and moves from 1 state to another depending on the input and a set of rules at any given state

    • ex: if at state 1 and the input is a 0, goto state 4

    • rules can be draw like image below: ↓

Lesson

• watch video "Alan Turing" 

• watch: https://www.youtube.com/watch?v=dNRDvLACg5Q

• watch: https://www.youtube.com/watch?v=RPQD7-AOjMI

Activity

• goto this website: https://aturingmachine.com/examples.php

  • watch the video and see a Turing machine count from 11 to 16!

Daily Assignment

• create a repo called: TEJ4M-Unit2-01

• add my existing Turing Machine (python):

  • see below

    • the current tape and state machine invert the binary number

• create a tape and state machine from my above repo on your Pi using python (it is already loaded!)

  • the Turing program it runs is counting up

    • give it a starting point of 11 in binary and ends at 16 (just like the above example)

  • NO NEED to touch my classes, just main.py

• hints:

  • each state will have 3 rules, one for each of the values it can see on the tape (0, 1 or blank)

Extra

• can you write a 2nd Turing program for your Turing machine