3 ms·

If the correctness of a program requires the ability to terminate, how do these proofs get around the Halting Problem?

• jgrahamc 17y ago
  These are not machine proofs, so they are not getting round the halting problem.
• MaysonL 17y ago
  You can't, for the general case, prove whether or not a program terminates. For many programs, you can.