what's the most beautiful number?
Show this thread
-
Chaitin's Ω is a number between 0 and 1. It's the probability that a randomly-generated program contains an infinite loop. If you knew Ω, you could then mechanically determine whether ANY mathematical statement is provable or not! However, it is impossible to compute Ω.
Just insert a contradiction in time such that the universe destroys and reforms itself until it has bogosorted away all numbers that are not Ω. You can do the same thing to solve NP Hard problems. It's literally just brute force process of elimination with infinite power
