Re: Functions computed by Turing Machines MUST apply finite string transformations to inputs +++

Liste des GroupesRevenir à cl c 
Sujet : Re: Functions computed by Turing Machines MUST apply finite string transformations to inputs +++
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory comp.lang.c comp.ai.philosophy
Suivi-à : comp.theory
Date : 04. May 2025, 17:06:43
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vv83ak$29nkb$3@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 25 26 27 28 29
User-Agent : Mozilla Thunderbird
On 5/3/2025 4:28 PM, dbush wrote:
On 5/3/2025 3:45 PM, Richard Heathfield wrote:
>
I am conscious that you have already explained to me (twice!) that Mr O's approach is aimed not at overturning the overarching indecidability proof but a mere detail of Linz's proof. Unfortunately, your explanations have not managed to establish a firm root in what passes for my brain. This may be because I'm too dense to grok them, or possibly it's because your explanations are TOAST (see above).
>
You have said, I think, that Olcott doesn't need a universal decider in order to prove his point. But a less ambitious decider doesn't contradict Linz's proof, surely? So once more for luck, what exactly would PO be establishing with his non-universal and impatient simulator if he could only get it to work?
 The core issue is that PO, despise being nearly 70 and having worked as a programmer, fundamentally doesn't understand proof by contradiction.
 
The actual issue is the NO ONE here (or perhaps anywhere)
sufficiently understands the key details about
COMPUTING THE MAPPING FROM AN INPUT TO AN OUTPUT.
Many here know that a mapping from the input must be
computed. What they don't know are ALL of the tiny
detailed steps required to compute this mapping.
They simply guess that because DD(DD) halts that
DD correctly simulated by HHH must also halt.
They cannot provide these detailed steps of the
execution trace of each machine instruction showing
exactly how DD correctly emulated by HHH halts
BECAUSE THEY KNOW THAT THEY ARE WRONG AND ONLY PLAYING HEAD GAMES.
_DD()
[00002133] 55         push ebp      ; housekeeping
[00002134] 8bec       mov ebp,esp   ; housekeeping
[00002136] 51         push ecx      ; make space for local
[00002137] 6833210000 push 00002133 ; push DD
[0000213c] e882f4ffff call 000015c3 ; call HHH(DD)
[00002141] 83c404     add esp,+04
[00002144] 8945fc     mov [ebp-04],eax
[00002147] 837dfc00   cmp dword [ebp-04],+00
[0000214b] 7402       jz 0000214f
[0000214d] ebfe       jmp 0000214d
[0000214f] 8b45fc     mov eax,[ebp-04]
[00002152] 8be5       mov esp,ebp
[00002154] 5d         pop ebp
[00002155] c3         ret
Size in bytes:(0035) [00002155]
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer

Date Sujet#  Auteur
2 May 25 * Functions computed by Turing Machines MUST apply finite string transformations to inputs3olcott
4 May 25 +- Re: Functions computed by Turing Machines MUST apply finite string transformations to inputs +++1olcott
5 May 25 `- Proficient C Programmers seem to get this right away1olcott

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal