EECS 395/495 Kolmogorov Complexity Spring 2011
Friday, April 8, 2011
Lecture 6
Random Strings are hard for the halting problem. Start of Prefix-free complexity.
Scribe Notes
by Kai Hayashi
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment