6.045: Automata, Computability, and
Complexity
Or, Great Ideas in Theoretical
Computer Science
Spring, 2010
Class 9
Nancy Lynch
Today
Mapping reducibility and Rices Theorem
Weve seen several undecidability proofs.
Today well extract some of the key ide
6.045: Automata, Computability, and
Complexity
Or, Great Ideas in Theoretical
Computer Science
Spring, 2010
Class 8
Nancy Lynch
Today
More undecidable problems:
About Turing machines: Emptiness, etc.
About other things: Post Correspondence Problem.
To
6.045: Automata, Computability, and
Complexity
Or, Great Ideas in Theoretical
Computer Science
Spring, 2010
Class 7
Nancy Lynch
Today
Basic computability theory
Topics:
Decidable and recognizable languages
Recursively enumerable languages
Turing Machine
6.045: Automata, Computability, and
Complexity
Or, Great Ideas in Theoretical
Computer Science
Spring, 2010
Class 5
Nancy Lynch
Today
Non-regular languages
Todays topics:
Existence of non-regular languages
Showing some specific languages arent regular
T
6.045: Automata, Computability, and
Complexity
Or, Great Ideas in Theoretical
Computer Science
Spring, 2010
Class 4
Nancy Lynch
Today
Two more models of computation:
Nondeterministic Finite Automata (NFAs)
Add a guessing capability to FAs.
But
6.045: Automata, Computability, and
Complexity
Or, Great Ideas in Theoretical
Computer Science
Spring, 2010
Class 3
Nancy Lynch
Today
Finite Automata (FAs)
Our third machine model, after circuits and decision trees.
Designed to:
Accept some strings of
6.080/6.089 GITCS
Feb 12, 2008
Lecture 3
Lecturer: Scott Aaronson
1
1.1
Scribe: Adam Rogal
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 incorporat
6.080/6.089 GITCS
Feb 5, 2008
Lecture 1
Lecturer: Scott Aaronson
1
Scribe: Yinmeng Zhang
Administrivia
Welcome to Great Ideas in Theoretical Computer Science. Please refer to the syllabus for course
information.
The only prerequisite for the class is math
6.045 Pset 6: Randomness and Cryptography
Assigned: Thursday, April 21, 2011
Due: Monday, May 2, 2011
To facilitate grading, remember to solve each problem on a separate sheet of
paper! Also remember to write your name on each sheet.
1. Prove the law of l
6.045 Pset 5: NP-Completeness and More
Assigned: Wednesday, April 6, 2011
Due: Thursday, April 14, 2011
To facilitate grading, remember to solve each problem on a separate sheet of
paper! Also remember to write your name on each sheet.
1. Let E XACT 4SAT
6.045 Pset 4
Assigned: Friday, March 4, 2011
Due: Tuesday, March 15, 2011
To facilitate grading, remember to solve each problem on a separate sheet of
paper! Also remember to write your name on each sheet.
1. Mother of Two Children. Write a (nonempty) com
6.045 Pset 3: The Gdel-Turing Mindblower
o
Assigned: Wednesday, February 23, 2011
Due: Wednesday, March 9, 2011
To facilitate grading, remember to solve each problem on a separate sheet of
paper! Also remember to write your name on each sheet.
1. Decidabl
6.045 Pset 2
Assigned: Friday, February 11, 2011
Due: Thursday, February 24, 2011
To facilitate grading, remember to solve each problem on a separate sheet of
paper!
1. Show that the following languages are context-free.
(a) L = an b2n : n 0
(b) The langu
6.045 Pset 1
Assigned: Thursday, February 3, 2011
Due: Wednesday, February 16, 2011
To facilitate grading, remember to solve each problem on a separate sheet of
paper!
1. Recall the protocol by which Alice commits herself to a bit x cfw_0, 1 without revea