Lecture 14 Notes: Calibration Techniques
Collider is sched-uled to start
digging a little deeper in less
than a year.
1
Computer science you can
think of as working in the
opposite direction. (Maybe
well eventually meet the
physicists
half-way.)
We
start
Lecture 1 Notes: Introduction
1
Administrivia
Welcome to Great Ideas in Theoretical Computer Science. Please refer to the syllabus for course
information.
The only prerequisite for the class is mathematical maturity, which means that you know
your way aro
Lecture 7 Notes: Introduction to Computational Complexity
1
Motivating Complexity Theory
Penroses Argument (continued)
Last lecture, Roger Penroses argument was introduced. It says that it was impossible for a computer to simulate the human brain. His arg
Lecture 2 Notes: Logic
Administrative announcements:
Two scribe notes per student needed.
If youve already taken 6.840, theres really no reason for you to take this class, unless you
enjoy my jokes. But if you take this class, theres reason to take 6.84
Lecture 3 Notes: Circuits and finite automata
1
1.1
Administrivia
Scribe notes
The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my own,
these notes are intended to incorporate other information we may mention duri
Lecture 5 Notes: Reducibility and Gdel
1
Administrivia
When it is your turn to
do scribe notes, please
have a rough draft
prepared
within
one
week. Then you have
until the end of the
course to get the notes in
better shape, and youll
want to do that becau
Lecture 4 Notes: Turing Machines
1
Previously in 6.089.
Last lecture, we talked about two dierent models of computation, nite automata and circuits.
Finite automata allowed us to recognize many properties of an arbitrarily long input, while circuits
allow
Lecture 6 Notes: Minds and machines
1
1.1
Administrivia
Scribe Notes
If you are doing the scribe notes for a lecture, remind Professor Aaronson to send you his own
lecture notes. Lecture 3 has been posted, and Lecture 4 should follow shortly.
1.2
Problem
Lecture 8 Notes: Polynomial Time
1
Administrivia
There will be two scribes notes per person for the term. In addition, you may now use the book to
review anything not clear from lecture since were on complexity.
2
Recap
In most cases of interest to us, th
Lecture 10 Notes: NP-completeness
1
Administrivia
Work hard on the homework,
but dont freak out. Come to
oce hours. There will be a
short (1 week) pset before
spring break, and an exam on
the Thursday after, which is
April 3rd.
2
Recap
Last time we saw a
Lecture 9 Notes: P and NP
1
Administrivia
1.1
Problem Set 1
Overall, people did really well. If youre not happy with how you did, or theres something you
dont understand, come to oce hours on Monday. No one got the challenge problem to prove
the completen