Kolmogorov Complexity
Lance Fortnow
1. Introduction
010101010101010101010101
100111011101011100100110
110100110010110100101100
Consider the three strings shown above. Although all are 24-bit binary strings
and therefore equally likely to represent the res

Homework due Wednesday, Sept. 14
1. Let A and B be languages. We say that Am B if there is a computable
function f such that, for every string x:
x A f (x) B
and
x 6 A f (x) 6 B.
(This is a very important relation on languages.)
Show that m is a transitiv

198:509: Foundations of Computer Science
Errata in the Text
The text for the class is: Theory of Computation by Dexter Kozen.
It appears that the book is also available in electronic form.
On this page, we list some errata that were noticed as we used the