Path: ...!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: joes <noreply@example.org>
Newsgroups: comp.theory
Subject: Re: Turing computable functions
Date: Wed, 26 Mar 2025 09:59:41 -0000 (UTC)
Organization: i2pn2 (i2pn.org)
Message-ID: <e14a71c932370dbfaa384f8ca8a595a4afe46ff5@i2pn2.org>
References: <vruvsn$3tamc$3@dont-email.me> <vrv0d4$3hle3$10@dont-email.me>
	<vrv18e$3tamc$4@dont-email.me> <vrv2aa$3hle3$11@dont-email.me>
	<vrv4up$3t3k$1@dont-email.me> <vrv5le$3hle3$12@dont-email.me>
	<vrv7vh$73q7$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 26 Mar 2025 09:59:41 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1811757"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="nS1KMHaUuWOnF/ukOJzx6Ssd8y16q9UPs1GZ+I3D0CM";
User-Agent: Pan/0.145 (Duplicitous mercenary valetism; d7e168a
 git.gnome.org/pan2)
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 2419
Lines: 35

Am Tue, 25 Mar 2025 16:42:09 -0500 schrieb olcott:
> On 3/25/2025 4:02 PM, dbush wrote:
>> On 3/25/2025 4:50 PM, olcott wrote:
>>> On 3/25/2025 3:05 PM, dbush wrote:
>>>> On 3/25/2025 3:47 PM, olcott wrote:
>>>>> On 3/25/2025 2:32 PM, dbush wrote:
>>>>>> On 3/25/2025 3:24 PM, olcott wrote:

>>>>>>> cannot possibly report on the behavior of any directly executing
>>>>>>> process. No Turing machine can every do this. This has always been
>>>>>>> beyond what any Turing machine can ever do.
>>>>>>
>>>>>> Strawman: reporting on an executing process is not a requirement.
>>>>>
>>>>> YOU JUST SAID THAT IT WAS YOU KEEP MINDLESSLY REPEATING THAT IT IS
>>>>> On 3/25/2025 2:32 PM, dbush wrote:
>>>>>  > (<X>,Y) maps to 1 if and only if X(Y) halts when executed
>>>>>  > directly
>>>>>
>>>> I never said it had to actually watch an executing process, only
>>>> report what would happen if it did run.
>>>>
>>> *It has been conclusively proven as a verified*
>>> *fact many hundreds of times over several years*
>>> That the behavior that the finite string input specifies
>> 
>> Is
> NOT ALWAYS
Should be.

>> the behavior of directly executing the described Turing machine.
Then the simulator is broken.

-- 
Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
It is not guaranteed that n+1 exists for every n.