Lecture #27 (23 April 2002)

More with Turing Machines

Overall Reading
Review pp. 271-277 [DH].

Outline:

  • Examples
  • Writing our own Turing Machine Programs

    • Examples

  • Example from Lab 8.1 of [DH] to make a copy of a string.

  • How about this contrived example?

    • Writing our own Turing Machine Programs

    Shall we try to write some new programs?

  • Given a string of 1's surrounded by blanks, replace the blank with symbol 'Y' if there are an even number of 1's, and with 'N' if there are an odd number of 1's. (solution)

  • Do we know how to increment a binary number?
    (solution)

  • Could we multiply two unary numbers? (solution)

    • comp150 Class Page
    mhg@cs.luc.edu
    Last modified: 17 April 2002