log in
Formal
Languages
and the
Theory of
Computation
Spring 2011
course
home
notes
syllabus
resources
questions
assignments
|
next
navigation
help
.. /
. /
Apr 3
last class : complexity ideas in the large
1. Remember where we've been :
regular/DFA < context-free/PDA < turing
2. Discuss the bigger picture :
the Complexity Zoo
the Petting Zoo
the Complexity Garden
Oracale Machine
Ideas / terms to understand :
P, NP, PSPACE, etc
oracle machine
Merlin/Arthur
BPP : probabilistic
Scott Aaronson's blog
:
timeline of computer science
the votes
http://cs.marlboro.edu/
courses/
spring2011/formal_languages/
notes/
Apr_3
last modified Tuesday May 3 2011 1:57 am EDT