Formal
Languages
and the
Theory of
Computation

Spring 2011
course
navigation

Apr 14

Chaitin's constant

See
Discuss the notion of "prefix-free" bitstrings, and why it matters in sum(2**-length(strings)).
http://cs.marlboro.edu/ courses/ spring2011/formal_languages/ notes/ Apr_14
last modified Wednesday April 13 2011 9:48 pm EDT