CSci 301 Lecture Notes

Week Four, Thursday: Definition of Algorithm

In this section we continue to develop the idea that Turing machines are equivalent to algorithms. Notice that in earlier sections, the "descriptions" of Turing machines looked a lot like descriptions of algorithms.

Hilbert's Problems

General (multivariate) polynomials.

Single variable polynomials.

Terminology for Describing Turing Machines

Example 3.14

Homework Assignment

Assigned Thursday, October 8, due Thursday, October 15, at beginning of class.

Chapter 3:
Exercises 3.7 and 3.8.
Problems 3.11, 3.17, and 3.19. <


Email: Richard dot J dot Wagner at gmail dot com

notes05b.htm, this hand crafted HTML file created August 31, 1998.
Last updated May 14, 2011, by Rick Wagner. Copyright © 1998-2011, all rights reserved.