Warning: mysqli::__construct(): (HY000/1203): User howardkn already has more than 'max_user_connections' active connections in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\includes\artfuncs.php on line 21
Failed to connect to MySQL: (1203) User howardkn already has more than 'max_user_connections' active connections
Warning: mysqli::query(): Couldn't fetch mysqli in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\index.php on line 66
Article <usqrcq$iit2$3@dont-email.me>
Deutsch   English   Français   Italiano  
<usqrcq$iit2$3@dont-email.me>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott2@gmail.com>
Newsgroups: comp.theory,sci.logic
Subject: Re: ZFC solution to incorrect questions: reject them
Date: Tue, 12 Mar 2024 19:18:34 -0500
Organization: A noiseless patient Spider
Lines: 72
Message-ID: <usqrcq$iit2$3@dont-email.me>
References: <usq5uq$e4sh$1@dont-email.me> <usq715$ed9g$3@dont-email.me>
 <usq8rh$etp9$1@dont-email.me> <usqb4a$1l201$32@i2pn2.org>
 <usqcts$froc$1@dont-email.me> <usqh4h$1lvbo$3@i2pn2.org>
 <usqhoj$gtih$2@dont-email.me> <usql2f$1m5uu$2@i2pn2.org>
 <usqmdi$hu9o$1@dont-email.me> <usqn3v$i33s$1@dont-email.me>
 <usqo6h$hubd$3@dont-email.me> <usqp0u$ie7v$1@dont-email.me>
 <usqq3p$iit2$1@dont-email.me> <usqqto$ipr7$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 13 Mar 2024 00:18:35 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="aa13334f329e2006d1dfb90f9960e443";
	logging-data="609186"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/jnnZjnFrmFpAVZsImpDQ0"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:hQ8bRybhzKAJNZ3B/L92rNKmGKA=
Content-Language: en-US
In-Reply-To: <usqqto$ipr7$1@dont-email.me>
Bytes: 4318

On 3/12/2024 7:10 PM, immibis wrote:
> On 13/03/24 00:56, olcott wrote:
>> On 3/12/2024 6:38 PM, immibis wrote:
>>> On 13/03/24 00:24, olcott wrote:
>>>> On 3/12/2024 6:05 PM, immibis wrote:
>>>>> On 12/03/24 23:53, olcott wrote:
>>>>>> On 3/12/2024 5:30 PM, Richard Damon wrote:
>>>>>>> On 3/12/24 2:34 PM, olcott wrote:
>>>>>>>> On 3/12/2024 4:23 PM, Richard Damon wrote:
>>>>>>>>> On 3/12/24 1:11 PM, olcott wrote:
>>>>>>>>>> Not exactly. A pair of otherwise identical machines that
>>>>>>>>>> (that are contained within the above specified set)
>>>>>>>>>> only differ by return value will both be wrong on the
>>>>>>>>>> same pathological input.
>>>>>>>>>
>>>>>>>>> You mean a pair of DIFFERENT machines. Any difference is 
>>>>>>>>> different.
>>>>>>>>
>>>>>>>> Every decider/input pair (referenced in the above set) has a
>>>>>>>> corresponding decider/input pair that only differs by the return
>>>>>>>> value of its decider.
>>>>>>>
>>>>>>> Nope.
>>>>>>>
>>>>>> ∀ H ∈ Turing_Machines_Returning_Boolean
>>>>>> ∃ TMD ∈ Turing_Machine_Descriptions  |
>>>>>> Predicted_Behavior(H, TMD) != Actual_Behavior(TMD)
>>>>>>
>>>>>> Every H/TMD pair (referenced in the above set) has a
>>>>>> corresponding H/TMD pair that only differs by the return
>>>>>> value of its Boolean_TM.
>>>>>>
>>>>>> That both of these H/TMD pairs get the wrong answer proves that
>>>>>> their question was incorrect because the opposite answer to the
>>>>>> same question is also proven to be incorrect.
>>>>>>
>>>>>
>>>>> Nobody knows what the fuck you are talking about. You have to 
>>>>> actually explain it. The same machine always gives the same return 
>>>>> value on the same input.
>>>>>
>>>>
>>>> It has taken me twenty years to translate my intuitions into
>>>> words that can possibly understood.
>>>
>>> You failed.
>>>
>>>> A pair of Turing Machines that return Boolean that are identical
>>>> besides their return value that cannot decide some property of
>>>> the same input are being asked the same YES/NO question having
>>>> no correct YES/NO answer.
>>>
>>> https://en.wikipedia.org/wiki/Turing_machine#Formal_definition
>>> A Turing machine is ⟨Q, Γ, b, Σ, δ, q0, F⟩
>>> Show me two ⟨Q, Γ, b, Σ, δ, q0, F⟩ that are identical besides their 
>>> return value.
>>> You can't because you are talking nonsense. they don't exist.
>>
>> Turing machine descriptions that are identical finite strings
>> except for the the 1/0 that they write the their exact same
>> tape relative location.
> 
> So which part of ⟨Q, Γ, b, Σ, δ, q0, F⟩ is different?
Exactly one element of Q differs by writing a 1 instead of a 0.

http://www2.lns.mit.edu/~dsw/turing/doc/tm_manual.txt
One quintuple has a different third element.

-- 
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer