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 <usn89c$3m7k2$4@dont-email.me>
Deutsch   English   Français   Italiano  
<usn89c$3m7k2$4@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
Subject: =?UTF-8?B?SCDin6jEpOKfqSDin6jEpOKfqSBpcyBjb3JyZWN0IHdoZW4gcmVwb3J0?=
 =?UTF-8?Q?s_on_the_actual_behavior_that_it_sees?=
Date: Mon, 11 Mar 2024 10:34:04 -0500
Organization: A noiseless patient Spider
Lines: 75
Message-ID: <usn89c$3m7k2$4@dont-email.me>
References: <usda7b$18hee$1@dont-email.me> <usdf9p$15934$2@i2pn2.org>
 <usdh1e$19t14$1@dont-email.me> <usdrrd$1bil8$1@dont-email.me>
 <usdseg$1bqt3$2@dont-email.me> <usdvj7$1fvhm$4@dont-email.me>
 <use138$15q44$4@i2pn2.org> <use1sh$1gd96$2@dont-email.me>
 <use37h$15q45$3@i2pn2.org> <use4f1$1grfn$1@dont-email.me>
 <8634t1nx2p.fsf@yaxley.in> <usfase$1p1t5$1@dont-email.me>
 <usfd8m$1p8cg$4@dont-email.me> <ush8rt$288t1$1@dont-email.me>
 <usi0ej$2d0oc$2@dont-email.me> <usk8s1$2v4mk$1@dont-email.me>
 <uskg40$30hr1$2@dont-email.me> <usmk7t$3hvpu$1@dont-email.me>
 <usn4k9$3li08$1@dont-email.me> <usn7b3$3m7lb$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Mon, 11 Mar 2024 15:34:05 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="1568d5e95fd7d0d459fb89959682569c";
	logging-data="3874434"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19hV5+BHS0B4w6WGT4PmdTk"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:0hAa0xzCpSVSvvqcv25fnZQIBXI=
In-Reply-To: <usn7b3$3m7lb$1@dont-email.me>
Content-Language: en-US
Bytes: 4343

On 3/11/2024 10:17 AM, Mikko wrote:
> On 2024-03-11 14:31:37 +0000, olcott said:
> 
>> On 3/11/2024 4:51 AM, Mikko wrote:
>>> On 2024-03-10 14:29:20 +0000, olcott said:
>>>
>>>> On 3/10/2024 7:25 AM, Mikko wrote:
>>>>> On 2024-03-09 15:49:39 +0000, olcott said:
>>>>>
>>>>>> On 3/9/2024 3:07 AM, Mikko wrote:
>>>>>>> On 2024-03-08 16:09:58 +0000, olcott said:
>>>>>>>
>>>>>>>> On 3/8/2024 9:29 AM, Mikko wrote:
>>>>>>>>> On 2024-03-08 05:23:34 +0000, Yaxley Peaks said:
>>>>>>>>>
>>>>>>>>>> With all of these extra frills, aren't you working outside the 
>>>>>>>>>> premise
>>>>>>>>>> of the halting problem? Like how Andre pointed out.
>>>>>>>>>
>>>>>>>>> Yes, he is.
>>>>>>>>>
>>>>>>>>>> The halting problem concerns itself with turing machines and 
>>>>>>>>>> what you
>>>>>>>>>> propose is not a turing machine.
>>>>>>>>>
>>>>>>>>> That is true. However, we can formulate similar problems and 
>>>>>>>>> proofs
>>>>>>>>> for other classes of machines.
>>>>>>>>>
>>>>>>>>
>>>>>>>> I am working on the computability of the halting problem
>>>>>>>> (the exact same TMD / input pairs) by a slightly augmented
>>>>>>>> notion of Turing machines as elaborated below:
>>>>>>>>
>>>>>>>> Olcott machines are entirely comprised of a UTM + TMD and one
>>>>>>>> extra step that any UTM could perform, append the TMD to the
>>>>>>>> end of its own tape.
>>>>>>>
>>>>>>> An important question to answer is whether a Turing machine can
>>>>>>> simulate your machines.
>>>>>>
>>>>>> Olcott machines are entirely comprised of a UTM + TMD and one
>>>>>> extra step that any UTM could perform, append the TMD to the end
>>>>>> of its own tape.
>>>>>
>>>>> Then a Turing machine can simulate your machine.
>>>>>
>>>>
>>>> Yes, except the TM doing the simulating cannot be an Olcott machine.
>>>
>>> That is not "ecept", that is containted in what the word "Truring 
>>> machine"
>>> means.
>>>
>>> Anway, a Truing machine can, with a simulation of your machine, compute
>>> everything your machine can, so your machine cannot compute anyting a
>>> Turing machine cannot.
>>>
>>
>> Turing Machines, Olcott Machines, RASP machines and my C functions
>> can always correctly report on the behavior of their actual input
>> When they report on this question:
>> Will you halt if you never abort your simulation?
> 
> If they only talk about themselves they are not useful.
> 

When every simulating halt decider reports on the actual behavior
that it actually sees, then the pathological input does not
thwart it.

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