| Deutsch English Français Italiano |
|
<vvguot$1auqp$3@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: dbush <dbush.mobile@gmail.com>
Newsgroups: comp.theory
Subject: Re: Formal systems that cannot possibly be incomplete except for
unknowns and unknowable
Date: Wed, 7 May 2025 20:44:14 -0400
Organization: A noiseless patient Spider
Lines: 49
Message-ID: <vvguot$1auqp$3@dont-email.me>
References: <vv97ft$3fg66$1@dont-email.me>
<b47c9e70d415c1e5e469aaab846f0bd05e4bcc51@i2pn2.org>
<vvall0$o6v5$1@dont-email.me> <vvc33h$25atc$1@dont-email.me>
<vvcgja$1voc$1@news.muc.de> <vvd6pf$34l9k$1@dont-email.me>
<vvdads$13pc$1@news.muc.de> <vvdcld$3arjo$1@dont-email.me>
<vvg6r9$15e69$1@dont-email.me> <vvg7uu$158tp$4@dont-email.me>
<vvg8tk$15e69$4@dont-email.me> <vvgai8$158tp$6@dont-email.me>
<vvgcme$15e69$9@dont-email.me> <vvgjdo$18i6e$2@dont-email.me>
<vvgkao$18q46$1@dont-email.me> <vvgkd7$15i5e$23@dont-email.me>
<vvgkum$18q46$3@dont-email.me> <vvgleo$15i5e$24@dont-email.me>
<vvgov4$1a47o$2@dont-email.me> <vvgp8b$15i5e$25@dont-email.me>
<vvgpk6$1a47o$4@dont-email.me> <vvgpo7$15i5e$26@dont-email.me>
<vvgq6o$1acph$1@dont-email.me> <vvgqgl$15i5e$27@dont-email.me>
<vvgr22$1ag3a$2@dont-email.me> <vvgt36$1auqp$2@dont-email.me>
<vvgtbe$1b0li$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Thu, 08 May 2025 02:44:14 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="a565b5a0e22116f8f680253905402a9a";
logging-data="1407833"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19oX0QX4OGbkhUUqPL9PS78"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:8Rnxx1PXDi9uhCwERFwmeSWmHBY=
Content-Language: en-US
In-Reply-To: <vvgtbe$1b0li$1@dont-email.me>
On 5/7/2025 8:19 PM, olcott wrote:
> On 5/7/2025 7:15 PM, dbush wrote:
>> On 5/7/2025 7:40 PM, olcott wrote:
>>> On 5/7/2025 6:31 PM, dbush wrote:
>>>> On 5/7/2025 7:26 PM, olcott wrote:
>>>>>
>>>>> When N instructions of DD are emulated by HHH
>>>>> according to the rules of the x86 language then
>>>>
>>>> The subject was "DD emulated by HHH", not "N instructions of DD
>>>> emulated by HHH".
>>>>
>>>> Changing the subject is the dishonest dodge of the strawman deception.
>>>
>>>
>>> That you and Richard construe anything less than an
>>> infinite number of steps of DD emulated by HHH
>>> (according to the rules of the x86 language)
>>> as an incorrect emulation IS MORONICALLY STUPID.
>>>
>>
>> The fixed immutable code of HHH simulates a fixed number X of
>> instructions of DD, the last of which was simulated incorrectly. Any
>> number other than X is not what HHH simulates and is therefore
>> irrelevant to HHH.
>>
>> UTM simulates X+Y instruction of DD correctly and reaches a final state.
>>
>
> I will make it easier to understand.
>
> void DDD()
> {
> HHH(DDD);
> return;
> }
>
> Can DDD simulated by HHH reach its own "return" instruction?
>
Category error. There is no "can" as algorithm HHH is fixed and
immutable, as is algorithm DDD.
Algorithm HHH *does not* simulate algorithm DDD to the end but instead
aborts in violation of the x86 language.
Algorithm UTM *does* simulate algorithm DDD to the end.