Prove that automatic problem solving (and, in particular, automatic programming) is Turing machine unsolvable/undecidable. You can prove it either directly by contradiction, or by reduction from another undecidable problem (e.g., the halting problem of the Universal Turing Machine)