Re: The error of the halting problem

Liste des GroupesRevenir à c theory 
Sujet : Re: The error of the halting problem
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theory sci.logic
Date : 04. Jun 2024, 03:44:01
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <v3lrh1$2uv03$1@i2pn2.org>
References : 1 2 3
User-Agent : Mozilla Thunderbird
On 6/3/24 8:59 PM, olcott wrote:
On 6/3/2024 7:55 PM, Richard Damon wrote:
On 6/3/24 4:53 PM, olcott wrote:
For any program H that might determine whether programs halt, a
"pathological" program D, called with some input, can pass its own
source and its input to H and then specifically do the opposite of what
H predicts D will do. No H can exist that handles this case. https://en.wikipedia.org/wiki/Halting_problem
>
The way that the halting problem is conventionally understood is that H
must correctly answer yes or no to an input that contradicts both
answers, thus H is being asked a question isomorphic to the Liar
Paradox: Is this sentence true or false: "This sentence is not true." ?
>
But it doesn't reduce to that, as the decider was fixed in code first, and then, by using that code, a question is constructed WITH A RIGHT ANSWER, that just isn't the answer that this decider happens to give.
>
You just don't seem to understand logic well enough to understand that not that subtitle difference.
>
 In other words you are trying to get away with saying
that it is only random chance that H gets the wrong
answer not that the game is rigged against H.
 
There is nothing "random" about it, if there was there would be a chance it could get it right.
The game IS just impossible to do, so HH will just always lose.
Its not fair to call it "rigged" as the results were not intentional, but it just turned out that way.
Sort of like it is impossible to create an always winning stratagy in Tic-Tac-Toe. It isn't like the game was DESIGNED to make that true, it just turned out that way.
For EVERY deterministic 2 player game, there will always be at least one player who doesn't have a winning strategy. That doesn't make it "rigged", just a fact of life.

Date Sujet#  Auteur
3 Jun 24 * The error of the halting problem21olcott
4 Jun 24 +* Re: The error of the halting problem17Richard Damon
4 Jun 24 i`* Re: The error of the halting problem16olcott
4 Jun 24 i +* Re: The error of the halting problem14Richard Damon
4 Jun 24 i i`* Re: The error of the halting problem13olcott
4 Jun 24 i i `* Re: The error of the halting problem12Richard Damon
4 Jun 24 i i  `* Re: The error of the halting problem11olcott
4 Jun 24 i i   +* Re: The error of the halting problem9Richard Damon
4 Jun 24 i i   i`* Re: The error of the halting problem8olcott
4 Jun 24 i i   i `* Re: The error of the halting problem7Richard Damon
4 Jun 24 i i   i  `* Re: The error of the halting problem6olcott
4 Jun 24 i i   i   +- Re: The error of the halting problem1Richard Damon
4 Jun 24 i i   i   +* Re: The error of the halting problem3joes
4 Jun 24 i i   i   i`* Re: The error of the halting problem --- G is untrue in PA2olcott
5 Jun 24 i i   i   i `- Re: The error of the halting problem --- G is untrue in PA1Richard Damon
4 Jun 24 i i   i   `- Re: The error of the halting problem1Mikko
4 Jun 24 i i   `- Re: The error of the halting problem1joes
4 Jun 24 i `- Re: The error of the halting problem1Mikko
4 Jun 24 `* Re: The error of the halting problem3Mikko
4 Jun 24  `* Re: The error of the halting problem2olcott
5 Jun 24   `- Re: The error of the halting problem1Richard Damon

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal