I don&#x27;t really understand the insight with Chaitin&#x27;s number. It&#x27;s unknowable, but so are a lot of things. The halting problem already says that there are programs which we can&#x27;t know if they will halt or not. And before that, Godel showed there are simple logical sentences which are true and unprovable.