You can use Rice's theorem[1], which is a generalized version of the Halting problem. I don't believe this proves that programming can't be automated, though.

You can use Rice's theorem[1], which is a generalized version of the Halting problem. I don't believe this proves that programming can't be automated, though. Humans too aren't able to prove completely that what they write is correct, it doesn't stop them from making programs. [1] https://en.wikipedia.org/wiki/Rice%27s_theorem https://en.wikipedia.org/wiki/Rice%27s_theorem