Chaitin's constant reveals computation's random core
Chaitin's constant, a measure of halting program probability, embodies the deep randomness underlying the undecidability of the halting problem in computation theory.
Alan Turing proved in 1936 that no algorithm can perfectly predict if any computer program will ever stop running. This "halting problem" is fundamentally undecidable. Decades later, mathematician Gregory Chaitin introduced Ω (Omega), a constant representing the probability that a randomly generated program will halt.
There's more to this story — open the app to keep reading.
Continue Reading in App
1 more paragraphs · plus a 3-question quiz