According to my cursory Google search, I have officially been the first person to use the term "reductio ad halting-problem
" to describe the common class of proofs that collapse onto Turing's well-known result.
I offer the following
as proof of my usage.
No, this has absolutely no significance whatsoever. Let me have my moment, dammit.