Little Stub for SRH

 Here's a nice intuitive demonstration of Turing proof that Halting cannot be determined by algorithm.

First thought was quantum theory like that "opening boxes" changes them.

But main purpose is to reconsider this in light of the idea there is really only 1 paradox: the liar paradox. And the conditions for this paradox are the conditions for SRH.

So what you have here is the negation box, and the whole thing encapsulated in an atomic statement.

But its slightly different. It uses the Halting Decision engine H to build a engine which negates and so fails.

But in fact this just says "I am false."

Consider some more when time. So is it really just Liar Paradox and does this give insight to that paradox cos it involved opening the box.