The halting problem proves that mathematics is <i>hard</i>. There is no algorithm that can prove&#x2F;disprove any decidable statement. Not even a a superslow algorithm.<p>Maybe ballooning is related to that...