whether provable statements can be distinguished from disprovable statements by strictly mechanical procedures in a finite amount of time
maybe the implication is that computation that computers end up doing is only possible if we allow us to know what statements will be finitely solvable and which not.
So these computers were aimed at very difficult problems. And not just hello world programs.
These computers were built to understand bomb blast radius, and inspired by calculating ballistic artillery projectile targeting.
