Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable

Liste des GroupesRevenir à l c 
Sujet : Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory
Date : 08. May 2025, 00:40:50
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vvgr22$1ag3a$2@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
User-Agent : Mozilla Thunderbird
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.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer

Date Sujet#  Auteur
30 May 25 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal