EECS 395/495 Kolmogorov Complexity Spring 2011
Monday, May 2, 2011
Lecture 16
Linear inequalities for K-complexity imply linear inequalities for Entropy.
Scribe Notes
by Darrell Hoy.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment