15-453 Formal Languages, Automata, and Computation
Lecture 27: Time Complexity

We begin a new segment of the course, concerned with a finer analysis of the class of decidable problems. First, we study time complexity, that is, the number of steps a Turing machine needs in order to compute as a function of the size of the input. In the area of algorithms, the focus is on showing how a problem can be solved efficiently. In the area of complexity, the focus is on showing that a problem cannot be solved more efficiently than a given lower bound.

[ Home | Schedule | Assignments | Handouts | Overview ]

Frank Pfenning