Abstract

The first essay discusses, in nontechnical terms, the paradox implicit in defining a random integer as one without remarkable properties, and the resolution of that paradox at the cost of making randomness a property which most integers have but can’t be proved to have. The second essay briefly reviews the search for randomness in the digit sequences of natural irrational numbers like π and artificial ones like Champernowne’s C = 0.12345678910111213 . . ., and discusses at length Chaitin’s definable-but-uncomputable number Ω, whose digit sequence is so random that no betting strategy could succeed against it. Other, Cabalistic properties of Ω are pointed out for the first time.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call