6.080 | Spring 2008 | Undergraduate

Great Ideas in Theoretical Computer Science

Lecture Notes

Lecture 5

Description:

Lecture notes on Turing machines, oracles, Diophantine equations, Turing degrees, reducibility, and Gödel’s incompleteness theorem.

Resource Type:
Lecture Notes

Course Info

As Taught In
Spring 2008
Learning Resource Types
Lecture Notes
Problem Sets