PROOF :We assume that Turing machine H decides ATM for the purpose of obtaining a contradiction. We construct the following machine B.
B =“On input w:
- Obtain, via the recursion theorem, own description ⟨B⟩.
- Run H on input ⟨B, w⟩.
- Do the opposite of what H says. That is, accept if H rejects and reject if H accepts.”
I can not understand point 3 I want to know its logic
Does this have same logic as the halting problem where if we get a yes it loops forever so it does not halt and if it does not halt we get a no then it halts?