Computability & Logic

Selmer Bringsjord

Handouts

• Midterm, Spring 98. The problems for the Midterm are:
  1. In Section 2.3, exercises 1, 2, 3
  2. In Section 4.2.1, exercises 1, 2
  3. In Section 4.2.2, exercises 1 and 4
  4. Three New
     • Section 4.2.1, exs. 3 & 4
     • Section 4.2.2, ex. 5
• Syllabus, Spring 98 ( html || postscript || dvi )
• Syllabus, Spring 97 ( html || postscript || dvi ) dvi )
• Set Theoretic Definition of Turing Machines ( postscript || dvi ))
• Diagonalization: Cantor's Proof, and "Array Version" from Boolos and Jeffrey. ( postscript || dvi )
• A Godelian Puzzle ( html || postscript || dvi )
• Chapter 12, Part I ( html || postscript || dvi )
• Project 4 ( html || postscript || dvi )

• Projects (old)
• Diagonalization: Cantor's Proof, and "Array Version" from Boolos and Jeffrey. (.ps) (.dvi)
• Remarks on Nondeterministism (.ps) (.dvi)
• Buchi Automata (finite state automata used to define infinite words) (.ps) (.dvi)
• Initial Material for Formalizing ZMs (.ps) (.dvi)
• Notes on McNaughton's Infinite Games (.ps) (.dvi)
• The Theory Q. (.html) (.ps) (.dvi)
• Preparting for the Shockers: Notes on Ch 14, B&J (.html) (.ps) (.dvi)
• Godel, Part I (start of Ch 15, B&J) (.html) (.ps) (.dvi)
• Turing Machines (in "Turing's World")
• CSLI Web site (site for Turing's World)
• A Java-based Turing Machine Simulator
• good starting point for exploring cellular automata