Logistics: 
TTh 3:305:00
Unique Number: 52505 Use Zoom links from Canvas. Syllabus posted on Canvas. Course web page: http://www.cs.utexas.edu/~diz/353 

Professor:  David Zuckerman Email: diz@cs.utexas.edu Office Hours: M 4:155:15, W 23 

TA:  Zihang He Email: zhhe AT utexas.edu Office Hours: WF 12 

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  
Videos:  Most of this class will be flipped  you'll be required to watch videos at home, and we will solve problems and answer questions in class. The videos, made by colleagues and myself, may be found here  
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.
A list of topics and approximate times follows.


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 

Canvas:  We will use Canvas, which contains Piazza. Homeworks and grades will be posted on Canvas. We will use Piazza for class discussion. Instead of emailing questions to the teaching staff, please post your question to Piazza. 