A colleague and I can't figure out what our professor is getting at with this question:
What follows from the incompleteness theorems about the provability of partial correctness assertions? What follows from the undecidability of the halting problem? Describe concrete instances for (families of) $A$, $B$, $\pi$ that show the difference!
Where $A$ is a precondition and $B$ a postcondition, and $\pi$ is the program. I think he might want to hear that incompleteness follows from undecidability, but I'm pretty much at a loss otherwise. Thanks!