Comments by "Алексей Алексеев" (@ne4to777) on "Computerphile" channel.

do not give this program to the machine and you will be able to solve the problem in all other cases.
1
@FawfulDied don't use H+ machine, but only H and all will be ok
1
@FawfulDied , my enemy can use any machine that he wants, but i will use H-machine and always get the right result. My enemy should fail on H-machine to prove halting problem.
1
@FawfulDied , You only confirm the problematic nature of the H+ machine. It's just unnecessary to use it at all. The halting problem is formulated as the absence of a GENERAL solution. And it really isn't if you use an H+ machine. But in all other cases, you can determine whether the program is running or not.
1
@FawfulDied , Okay, imagine a program that works flawlessly. Then you took and added a couple of lines of code there, after which it stopped working. What is so surprising here? First rule of programming. If it works don't touch anything.
1
@FawfulDied , you are absolutely right in this case. But the video says (4:44) that the H+ algorithm is used both as an executable program for analysis and as input data for itself. Let's add some formalism. 1. We have: H(X) -> true | false, where H - analysis program, X - data for analysis 2. We need to prove that: H(X) -> absurd 3. The video proves that: H+(H+) -> absurd. 4. You said, that: H(H+) -> absurd. But it's not (4:44). This is proofs for different theories
1