[FrontPage] [TitleIndex] [WordIndex

Up to ReadingRoom

Each of the theory textbooks has a good section on Turing Machines. In class on 16 Nov we will be covering TMs as automata. On 19 Nov we will be covering universality and undecidability (including diagonalization and the halting theorem).

The following table provides a key to which parts of which theory books cover these topics.

Additional resources on Turing Machines (relatively triaged):

Finally, JFLAP supports TMs.

2013-07-17 10:43