Re: ZFC solution to incorrect questions: reject them --discourse context --

On 3/16/2024 4:10 PM, immibis wrote:

On 16/03/24 20:55, olcott wrote:

Ĥ.H is not gagged unable to answer.
Every element of the infinite set of Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩ only gets
the wrong answer because its answer is contradicted.

 I've noticed that every time you talk about "every" or "infinite sets" it doesn't make sense.
 

Do you understand that an algorithm can be encoded in an
infinite number of different ways?
Do you understand that this applies to H?
Do you understand that when this does apply to H that this also
applies to Ĥ.H ?

"The infinite set of Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩" doesn't make a lot of sense the way it's written.
 It's true that for every program P (I will not call it H because that will confuse you), P(GetCounterexampleProgram(P), GetCounterexampleProgram(P)) != Halts(GetCounterexampleProgram(P), GetCounterexampleProgram(P))
 This does not mean that Halts(GetCounterexampleProgram(P), GetCounterexampleProgram(P)) has no answer.

For every possible way that H can be encoded Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩
gets the wrong answer because every answer is contradicted.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer