Liste des Groupes | Revenir à c theory |
On 2/22/2025 12:17 PM, joes wrote:Nope, because, BY DEFINITION, a decider will stop in finite time, and thus a correct decider can always be simulated to its end.Am Sat, 22 Feb 2025 12:07:17 -0600 schrieb olcott:You can equally assume that squares are round.On 2/22/2025 10:45 AM, joes wrote:No. Simulating a decider never needs to be aborted.Am Sat, 22 Feb 2025 10:28:34 -0600 schrieb olcott:>On 2/22/2025 3:34 AM, Fred. Zwarts wrote:Op 22.feb.2025 om 00:15 schreef olcott:The code proves that it is correct.Because the code proves that HHH does simulate itself correctly it isNo, the code proves that HHH simulates a different version that doesn't
not stupid for HHH to simulate itself. This was the most difficult
aspect of creating the x86utm operating system.
abort. See line 1059.
HHH does correctly recognize and terminate the infinite recursion
behavior pattern.
>
you never did tell me whether or not you fully
understand what infinite recursion is.
Les messages affichés proviennent d'usenet.