Posts
Sensing that a computer program is “elegant” requires discernment. Proving mathematically that it is elegant is, Gregory Chaitin impossible.
 |
| Abstract virtual binary code illustration on blurry modern office building background. Big data and coding concept. Multiexposure |
In this week’s podcast, “The Chaitin Interview IV: Knowability and Unknowability,” Walter Bradley Center director Robert J. Marks interviewed mathematician Gregory Chaitin on his “unknowable number.” That’s the topic of this series, based on the fourth podcast. Last week, we tried getting to know the unknowable number. Today, let’s look at the question of how we know that the number is unknowable — instead of merely non-computable. Lots of things are non-computable but we do not expect that to be true of numbers.
Source: Mind Matters
