Re: The error of the halting problem

On 6/3/24 10:58 PM, olcott wrote:

On 6/3/2024 9:47 PM, Richard Damon wrote:

On 6/3/24 10:32 PM, olcott wrote:

On 6/3/2024 9:26 PM, Richard Damon wrote:

On 6/3/24 10:14 PM, olcott wrote:

On 6/3/2024 8:58 PM, Richard Damon wrote:

On 6/3/24 9:51 PM, olcott wrote:

>
When H is asked a yes/no question where both answers are
contradicted by its input *IT IS A FREAKING RIGGED GAME*

>
But both answers aren't wrong. Remember, the question is built to make a SPECIFIC decider wrong, and by its algorithm, it will give a SPECIFIC answer to each SPECIFIC question.
>

>
You can't get away with that head game by pretending
to not understand what infinite an set of H/D pairs is.

>
But it doesn't matter.
>

>
It matters enormously. Once we fully understand that the limits
of computation were always a ruse then we can give computation
the priority that it truly deserves. It might be the life on earth
is killed off because we did not build a semantic lie detector
quickly enough.

>
But you are working on it wrong, because you just don't understand the actual nature of truth.

 Every expression X that is true on the basis of its meaning can be
proven untrue by a lack of a connection to the meaning that makes it
true. *You have understood this better than anyone else*
 When D is defined to contradict both values that H returns then
D is not a truth bearer in H in the same way that the Liar Paradox
"This sentence is not true" is not a truth bearer in English.
 

Except that H only returns ONE value for a given input. PERIOD.
Does H^ applied to (H^) has an definite answr for each specific H^
It is just constructed that the H that a given H^ was constructed from, gives the wrong answer, and this can happen because that H's behavior to ALL inputs was fixed when it was created and defined.
You don't seem to understnd this fundamental nature of programs.
You seem to think that deterministic programs act just like volitional beings, which have the freedom to choose.
Maybe because you lost your freedom to choose because you lost your soul.
Turing just found a quick way to show that he can make an input for EVERY POSSIBLE H that it will happen to get wrong. "Happen", not because the basic nature of the Halting Question says it will get it wrong, but because it turns out that Turing Macines are powerful enough to allow you to simply make a machine that makes another specific machine get the wrong answer about it.