While organizing some files today I came across my copy of Charles H. Bennett's "On Random and Hard-to-Describe Numbers" from 1979 (https://www.worldscientific.com/doi/abs/10.1142/9789812770837_0001). It discusses Chaitin's constant (https://en.wikipedia.org/wiki/Chaitin%27s_constant) for a programming language, which is the probability \(\Omega\) that a randomly-chosen program will compile. This is a real number between 0 and 1 which is definable but not computable.
Bennett goes on to discuss the "Cabalistic" properties of \(\Omega\). Knowing the first few thousand digits of \(\Omega\) would allow one to decide practically all finitely refutable mathematical conjectures. Basically, \(\Omega\) is a very compact encoding of the Halting Problem (https://en.wikipedia.org/wiki/Halting_problem), so knowing its first \(n\) bits is enough to determine whether any program up to \(n\) bits in length would eventually halt. While there are some exceptions, many open problems in mathematics can be phrased in terms of the halting of some computer program of reasonably short length.
(1/3)
#math #mathematics #ComputerScience #hypercomputer #programming #microfiction #ScienceFiction #physics #BlackHole #ClosedTimelikeCurve #relativity #probability
