The halting problem proves that mathematics is hard. There is no algorithm that can prove/disprove any decidable statement. Not even a a superslow algorithm. M

The halting problem proves that mathematics is hard. There is no algorithm that can prove/disprove any decidable statement. Not even a a superslow algorithm. Maybe ballooning is related to that...