HONORS THEORY OF COMPUTATION
SPRING 2002
Chee Yap
Please pick up my book chapters from
ftp://cs.nyu.edu/pub/local/yap/complexity-bk/
.
Additional Lecture Notes:
Finite Automata and Regular Languages:
[
postscript
] [
pdf
]
Regular Expressions and Regular Pumping Lemma:
[
postscript
] [
pdf
]
Context Free Languages:
[
postscript
] [
pdf
]
Recursively Enumerable Languages:
[
postscript
] [
pdf
]
Reading Guide for Chapter 2:
[
postscript
] [
pdf
]
Reading Guide for Chapter 3-6:
Reducibilities, Complete Languages, Separation Results
Reading Guide for Chapter 7:
Choice Machines and Alternation
Also, here is a slightly updated version of chapter 7: [
c7.ps
] [
c7.pdf
]
Updated Chapter 8 on Interactive Proofs:
[
c8.ps
] [
c8.pdf
]
Chapter on
Kolmogorov Complexity
:
[
c19.ps
] [
c19.pdf
] [
replacement proof (ps)
] [
replacement proof (pdf)
]
Chapter on
Quantum Complexity
: (5/6/02: replaced old version)
[
c22.ps
] [
c22.pdf
] [
teleport.ps
] [
teleport.pdf
]
READING GUIDE:
Chapter 8:
Stochastic Computation
Chapter 19:
Kolmogorov Complexity
Chapter 22:
Quantum Complexity