# Theory of Computation (CS 6160) - Fall 2021

## Instructor: Mohammad Mahmoody

## Syllabus

You can find the syllabus here. There, you can find all the information about course's goals, plans, logistics, grading policy, etc.

## Lectures

Below you can find the slides of the lecture (behind collab) as well as related notes for each class. The posts are in reverse chronological order.

The tentative schedule is here.

- Class 13 (Nov 19) Secure Multi-Party Computation, and Quantum Computing.

After class, you can find the slides here.

- Class 12 (Nov 12) Defining Perfect and Computational Zero Knowledge, Computational ZK for all of NP from commitments.

After class, you can find the slides here.

- Class 11 (Nov 5) Interactive and Zero-Knowledge Proofs.

Reading: Arora-Barak Book, Sections 8 and 9.4.

After class, you can find the slides here.

- Class 10 (Oct 29) Interactive Proofs.

Reading: Arora-Barak Book, Sections 8 and 9.4.

After class, you can find the slides here.

- Class 9 (Oct 22) Search to decision (Cook/Turing) reductions, randomized complexity classes and error reduction.

Reading: Arora-Barak Book, Sections 2.5 and 7.1,7.2,7.3,7.4.

After class, you can find the slides here.

- Class 8 (Oct 15) More on NP and NP Completeness

Reading: Arora-Barak Book, Sections 2.3, 2.4.

After class, you can find the slides here.

- Class 7 (Oct 8) Space Complexity and Nondeterminism

Reading: Arora-Barak Book, Sections 2.1, 2.2, and 4.1.

After class, you can find the slides here.

- Class 6 (Oct 1) Proving Godel's theorem using undecidability, time hierarchy theorem.

Reading: Sipser's Book, Section 4, Arora-Barak Book Section 3.

After class, you can find the slides here.

- Class 5 (Sept 24) Decidable and Recognizable languages. Undecidability through Diagonalization.

Reading: Arora-Barak Book Section Section 1 and 3.1

After class, you can find the slides here.

- Class 4 (Sept 17) Proving Pumping Lemma for CF languages. Turing Machines.

Reading: Sipser's Book, Section 3.

After class, you can find the slides here.

- Class 3 (Sept 10) Non-regular languages, Context Free Grammer

Reading: Sipser's Book, Sections 1.4, 2.1, 2.3

After class, you can find the slides here.

- Class 2 (Sept 3) Nondeterminism, Regular Operations.

Reading: Sipser's Book, Sections 1.2, 1.3.

After class, you can find the slides here.

- Class 1 (Aug 27) A bird's view, finite state computation.

Reading: Sipser's Book, Section 1.1.

After class, you can find the slides here.