log in
Formal
Languages
and the
Theory of
Computation
Spring 2011
course
home
notes
syllabus
resources
questions
assignments
|
next
navigation
help
.. /
. /
Apr 14
Chaitin's constant
See
Chaitin's summary of his work
Chaitin's 1975 paper introducing Omega
wikipedia: prefix code
wikipedia: Chaitin's constant
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