uncomputable number
A number whose shortest generating code is no shorter than the number itself, so no algorithm can produce it more efficiently than listing its digits—most real numbers between zero and one are of this type.
As defined in 124 | Solo: How Time Travel Could and Should Work
Where it comes up · 1
Most important claims · 1 of 1Search all claims for “uncomputable number” →
- Turing proved that some numbers are uncomputable—their generating code is exactly as long as the number itself—and that the overwhelming majority of numbers between zero and one are of this type, meaning there are infinitely many facts about simple numbers that we can never know.124 | Solo: How Time Travel Could and Should Work