&gt; &quot;Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist.&quot;<p>You seem to be mixing up where the &quot;for all&quot; lies. The result is:<p>There does not exist a procedure that, for all (program, input) pairs, the procedure will say whether the program halts for that input.<p><pre><code>    {p | Ɐ(f,i): p(f,i) says whether f(i) will halt } = ∅
</code></pre>
You are using it as if it said:<p>For all (program, input) pairs, there does not exist a procedure that will say whether the program halts for that input.<p><pre><code>    Ɐ(f,i): {p | p(f,i) says whether f(i) will halt } = ∅
</code></pre>
<i>&quot;post evidence (as I have done)&quot;</i><p>What is at issue is your incorrect assertions about what your evidence <i>says</i>.  We read it, it contradicts you, everyone points this out, and you just ignore it and get louder.