Theoretical Foundations of Computing

Prof. Dr. Pascal Hitzler

Kno.e.sis Center, Wright State University, Dayton, Ohio

Fall Quarter 2010

Meeting Times

Course Materials

Slides and my personal manuscript will be posted here as they become available. However, relevant for the exams is the material presented in class. If you miss a class, it's your responsibility to get all missing information.

Downloads
Slides 2010-09-07 - Introduction (final)
Slides 2010-09-09 - Infinities, Languages, Automata (final)
Slides 2010-09-09 - 2010-09-28 - Chapter 8 (Turing Machines) (final)
Slides 2010-09-30 - 2010-10-01 - Chapter 9 (Turing Computable Functions) (final)
Slides 2010-10-05 - Chapter 11 (Decidability) (final)
Slides 2010-10-07 - 2010-10-28 - Chapter 12 (Undecidability) (final)
Slides 2010-11-02 - 2010-11-04 - Chapter 13 (Mu-recursive functions) (final)

Evaluation
Homework (20%), mid-term exam (30%), final exam (50%)
Grading will follow a standard scale (A: 100-90, B: 89-80, C: 79-70, D: 69-60, F: 59-0)

Course Outline (tentative)
Note the cancelled classes below. Replacement sessions on Fridays will be in Russ 346.


Back to my home page.