CS353 - Theory of Computation (Spring 2023)

Logistics: TTh 2:00--3:30, GDC 4.304 (in person only)
Unique Number: 52320
Course web page: http://www.cs.utexas.edu/~diz/353
Professor: David Zuckerman
Email: diz@cs.utexas.edu
Who should
take this?
Students interested in the science of computation, who like mathematics and proofs, and who like a challenge. Students who liked CS 331 or 331H should like this class. This course is excellent preparation for graduate school.
Text: Michael Sipser, Introduction to the Theory of Computation
Course Overview: This undergraduate course develops a theoretical framework to understand computation. Perhaps the most important concept in the class is that there are limits to computation. Some languages are uncomputable; others are "complete" for certain hard classes, such as NP. Sometimes these limitations prove useful, as in the case of cryptography. We will also explore tradeoffs and relationships between different computational resources, such as time and space. The course should be similar to the 2018 version. (The 2021 version was flipped, but this year won't be.) A list of topics and approximate times follows.

Topic Chapter(s) Approximate Time
Regular Languages 1 1-2 weeks
Decidability 3-4 1-2 weeks
Reducibility 5 1 week
Time Complexity 7 2-3 weeks
Space Complexity 8 1-2 weeks
Intractibility 9 1 week
Parallel Computation 10.5 1 lecture
Approximation & Randomization 10.1,10.2 1 week
Cryptography & Iteractive Proofs 10.4, 10.6 1 week

Prerequisites: CS 331 or 331H. Naturally, you also need the prerequisites and corequisites for CS 331, including Discrete Math (CS 311 or 311H), Probability (SDS 321 or M 362K), and Linear Algebra (SDS 329C, Math 340L, or Math 341).
Grading: 60% 3 Exams
30% Homework
10% Participation

Last modified: November 3, 2022