Re: ZFC solution to incorrect questions: reject them

Liste des GroupesRevenir à ca philosophy 
Sujet : Re: ZFC solution to incorrect questions: reject them
De : polcott2 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory sci.logic
Date : 13. Mar 2024, 23:54:44
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <ust7b4$15m14$3@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
User-Agent : Mozilla Thunderbird
On 3/13/2024 4:39 PM, Richard Damon wrote:
On 3/13/24 1:52 PM, olcott wrote:
On 3/13/2024 12:52 PM, Richard Damon wrote:
On 3/13/24 10:08 AM, olcott wrote:
On 3/13/2024 11:44 AM, immibis wrote:
On 13/03/24 04:55, olcott wrote:
On 3/12/2024 10:49 PM, Richard Damon wrote:
>
Not quite. It always gets the wrong answer, but only one of them for each quesiton.
>
>
They all gets the wrong answer on a whole class of questions
>
Wrong. You said. yourself. that H1 gets the right answer for D.
>
>
Since it is a logical impossibility to determine the truth
value of a self-contradictory expression the requirement
for H to do this is bogus.
>
Shows you are just a LIAR, as there IS a truth value to the expression that is the requirment for ANY SPECIFIC H.
>
>
*Lying about me being a liar may possibly cost your soul*
*Lying about me being a liar may possibly cost your soul*
*Lying about me being a liar may possibly cost your soul*
>
There is no mapping from H(D,D) to Halts(D,D) that exists.
This proves that H(D,D) is being asked an incorrect question.
>
 Why, because it is NOT a LIE.
 You don't even know the definiton of an incorrect question.
 
I invented it so I get to stipulate its meaning.
https://groups.google.com/g/sci.lang/c/AO5Vlupeelo/m/nxJy7N2vULwJ

The fact that there DOES exist a mapping Halt(M,d) that maps all Turing Machines and there input to a result of Halting / Non-Halting for EVERY member of that input set, means tha Halts is a valid mapping to ask a decider to try to decider.
 
That part is true.
Likewise when you ask a man that has never been married:
Have you stopped beating tour wife?
There are some men that have stopped beating their wife.

The fact that no machine that exist that computes that mapping, means the mapping is uncomputable.
 
Likewise the square-root of an actual banana is also uncomputable
for the same logical impossibility reason.

Perhaps you should actually learn the technical meaning of the terms before you state LIES about them.
 
Revelations 21:8 NRSV
...all liars, their place will be in the lake that burns
with fire and sulphur, which is the second death.’
I am pointing out and correcting the incoherence of the
meaning of these terms.

Yes, I guess it would be an incorrect question to ask what a correct halt decider computes for a given input, the best I can interprete your statement, since no H that does that can exist, but that isn't what the question asks.
 You are just stuck in the LIES you have created with your strawmen and ignorance of the subject you are talking about.
*You know that I am not saying anything that I do not believe*
Revelations 21:8 NRSV
...all liars, their place will be in the lake that burns
with fire and sulphur, which is the second death.’
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer

Date Sujet#  Auteur
10 Nov 24 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal