Deutsch   English   Français   Italiano  
<1bd3d2511b572607198892bbd8244736393d6a55@i2pn2.org>

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

Path: nntp.eternal-september.org!news.eternal-september.org!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: How do simulating termination analyzers work? ---Truth Maker
 Maximalism
Date: Fri, 4 Jul 2025 18:23:32 -0000 (UTC)
Organization: i2pn2 (i2pn.org)
Message-ID: <1bd3d2511b572607198892bbd8244736393d6a55@i2pn2.org>
References: <102sjg5$2k3e9$1@dont-email.me> <103394q$m26r$1@dont-email.me>
	<1033pf6$25t1$1@dont-email.me> <1035vdm$10d9c$1@dont-email.me>
	<1036qg0$16lpk$3@dont-email.me> <1038glb$e9bd$1@dont-email.me>
	<1039kq9$n1od$1@dont-email.me> <103aupj$13t8e$1@dont-email.me>
	<103c0mb$1cme6$2@dont-email.me> <103dp34$1toq7$1@dont-email.me>
	<103eeie$22250$12@dont-email.me> <103g682$2k9u7$1@dont-email.me>
	<103h1ch$2q86f$5@dont-email.me> <103j40h$3col5$1@dont-email.me>
	<103n9si$ecm8$1@dont-email.me> <103okoh$r8lq$1@dont-email.me>
	<103oql4$rq7e$7@dont-email.me> <103qu9v$1egu3$1@dont-email.me>
	<103rh5r$1hc53$7@dont-email.me> <103th0k$22kgq$1@dont-email.me>
	<103uin0$292c0$7@dont-email.me> <104041c$2nne5$1@dont-email.me>
	<1040hq4$2ql69$3@dont-email.me> <1042l0e$3cik5$1@dont-email.me>
	<1046v71$ctak$1@dont-email.me>
	<2f6ef2a106265ec3d3aaaefb0da94ff758f75f7e@i2pn2.org>
	<1048gmn$qd4f$1@dont-email.me>
	<08a80a1cb9e11694118540c65776156824a9b2f2@i2pn2.org>
	<1049344$u8im$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 4 Jul 2025 18:23:32 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="3321465"; 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

Am Fri, 04 Jul 2025 12:30:43 -0500 schrieb olcott:
> On 7/4/2025 8:37 AM, joes wrote:
>> Am Fri, 04 Jul 2025 07:16:23 -0500 schrieb olcott:
>>> On 7/4/2025 3:55 AM, joes wrote:
>>>> Am Thu, 03 Jul 2025 17:11:45 -0500 schrieb olcott:
>>>>> On 7/2/2025 1:53 AM, Mikko wrote:
>>>>>> On 2025-07-01 11:46:11 +0000, olcott said:

>>>> You are effectively saying that all programs that start with a call
>>>> to HHH are the same.
Did I misunderstand you?

>>> Because it is not an input it HHH is not accountable for its behavior.
>>> Deciders are only accountable for computing the mapping from their
>>> inputs.
>> Yes it is, HHH should compute whether the code of DD halts when run.
>> You can't be thinking that is uncomputable.
> Likewise we should also compute the area of a square circle with a
> radius of 2.
Are you seriously suggesting that you can't compute what the code of
DDD does when executed?

> Partial halt deciders have never been allowed to report on the behavior
> of any directly executed Turing machine. Instead of this they have used
> the behavior that their input machine description specifies as a proxy.
And you think that DDD's direct execution is not specified by its
description?


> Now for the first time we see that DDD correctly simulated by HHH *IS
> NOT A PROXY* for the behavior of the directly executed DDD().
Indeed, HHH does not simulate it correctly. (You can't mean that DDD
is *executed* incorrectly.)

-- 
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.