Turing Machine computable functions apply finite string transformations to inputs

Liste des GroupesRevenir à theory 
Sujet : Turing Machine computable functions apply finite string transformations to inputs
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory
Date : 26. Apr 2025, 17:22:42
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vuj18i$2lf64$6@dont-email.me>
References : 1 2 3 4 5 6 7 8
User-Agent : Mozilla Thunderbird
On 4/25/2025 5:09 PM, joes wrote:
Am Fri, 25 Apr 2025 16:46:11 -0500 schrieb olcott:
On 4/25/2025 11:54 AM, Richard Damon wrote:
On 4/25/25 12:31 PM, olcott wrote:
 
Once we understand that Turing computable functions are only allowed
to derived their outputs by applying finite string operations to their
inputs then my claim about the behavior of DD that HHH must report on
is completely proven.
>
Youy have your words wrong. They are only ABLE to use finite algorithms
of finite string operations. The problem they need to solve do not need
to be based on that, but on just general mappings of finite strings to
finite strings that might not be described by a finite algorithm.
The mapping is computable, *IF* we can find a finite algorith of
transformation steps to make that mapping.
>
There are no finite string operations that can be applied to the input
to HHH(DD) that derive the behavior of of the directly executed DD thus
DD is forbidden from reporting on this behavior.

Yes, there are, the operations that the processor executes. How did you
think it works?
 
When you try to actually show the actual steps
instead of being stuck in utterly baseless rebuttal
mode YOU FAIL!
_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]
When any HHH emulates DD according to the finite
string transformation rules specified by the x86
language (the line of demarcation between correct
and incorrect emulation) no emulated DD can possibly
reach its final halt state and halt.
--
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
21 Apr 25 * Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error450Keith Thompson
22 Apr 25 +* Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error442olcott
22 Apr 25 i+- Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error1Richard Damon
25 Apr 25 i`* Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error440olcott
25 Apr 25 i +* Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error195Richard Damon
25 Apr 25 i i`* Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error194olcott
25 Apr 25 i i +* Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error192joes
26 Apr 25 i i i`* Turing Machine computable functions apply finite string transformations to inputs191olcott
26 Apr 25 i i i +- Re: Turing Machine computable functions apply finite string transformations to inputs1dbush
26 Apr 25 i i i +* Re: Turing Machine computable functions apply finite string transformations to inputs188joes
26 Apr 25 i i i i`* Re: Turing Machine computable functions apply finite string transformations to inputs187olcott
26 Apr 25 i i i i +* Re: Turing Machine computable functions apply finite string transformations to inputs185Fred. Zwarts
26 Apr 25 i i i i i`* Re: Turing Machine computable functions apply finite string transformations to inputs184olcott
26 Apr 25 i i i i i +- Re: Turing Machine computable functions apply finite string transformations to inputs1dbush
26 Apr 25 i i i i i +* Re: Turing Machine computable functions apply finite string transformations to inputs181Richard Damon
26 Apr 25 i i i i i i`* Re: Turing Machine computable functions apply finite string transformations to inputs180olcott
26 Apr 25 i i i i i i +* Re: Turing Machine computable functions apply finite string transformations to inputs172dbush
26 Apr 25 i i i i i i i`* Re: Turing Machine computable functions apply finite string transformations to inputs171olcott
26 Apr 25 i i i i i i i `* Re: Turing Machine computable functions apply finite string transformations to inputs170dbush
27 Apr 25 i i i i i i i  `* Re: Turing Machine computable functions apply finite string transformations to inputs169olcott
27 Apr 25 i i i i i i i   +* Re: Turing Machine computable functions apply finite string transformations to inputs137dbush
27 Apr 25 i i i i i i i   i`* Re: Turing Machine computable functions apply finite string transformations to inputs136olcott
27 Apr 25 i i i i i i i   i +* Re: Turing Machine computable functions apply finite string transformations to inputs134dbush
27 Apr 25 i i i i i i i   i i+* Re: Turing Machine computable functions apply finite string transformations to inputs132olcott
27 Apr 25 i i i i i i i   i ii+* Re: Turing Machine computable functions apply finite string transformations to inputs5dbush
28 Apr 25 i i i i i i i   i iii`* Re: Turing Machine computable functions apply finite string transformations to inputs4olcott
28 Apr 25 i i i i i i i   i iii +- Re: Turing Machine computable functions apply finite string transformations to inputs1joes
28 Apr 25 i i i i i i i   i iii +- Re: Turing Machine computable functions apply finite string transformations to inputs1Richard Damon
28 Apr 25 i i i i i i i   i iii `- Re: Turing Machine computable functions apply finite string transformations to inputs1dbush
28 Apr 25 i i i i i i i   i ii+- Re: Turing Machine computable functions apply finite string transformations to inputs1Richard Damon
28 Apr 25 i i i i i i i   i ii`* Re: Turing Machine computable functions apply finite string transformations to inputs125Fred. Zwarts
28 Apr 25 i i i i i i i   i ii `* Re: Turing Machine computable functions apply finite string transformations to inputs124Richard Heathfield
28 Apr 25 i i i i i i i   i ii  `* Re: Turing Machine computable functions apply finite string transformations to inputs123olcott
28 Apr 25 i i i i i i i   i ii   +* Re: Turing Machine computable functions apply finite string transformations to inputs15dbush
28 Apr 25 i i i i i i i   i ii   i`* Re: Turing Machine computable functions apply finite string transformations to inputs14olcott
28 Apr 25 i i i i i i i   i ii   i +* Re: Turing Machine computable functions apply finite string transformations to inputs11dbush
28 Apr 25 i i i i i i i   i ii   i i`* Re: Turing Machine computable functions apply finite string transformations to inputs10olcott
28 Apr 25 i i i i i i i   i ii   i i +* Re: Turing Machine computable functions apply finite string transformations to inputs7dbush
28 Apr 25 i i i i i i i   i ii   i i i`* Re: Turing Machine computable functions apply finite string transformations to inputs6olcott
28 Apr 25 i i i i i i i   i ii   i i i +* Re: Turing Machine computable functions apply finite string transformations to inputs4dbush
28 Apr 25 i i i i i i i   i ii   i i i i`* Re: Turing Machine computable functions apply finite string transformations to inputs3olcott
28 Apr 25 i i i i i i i   i ii   i i i i +- Re: Turing Machine computable functions apply finite string transformations to inputs1dbush
29 Apr 25 i i i i i i i   i ii   i i i i `- Re: Turing Machine computable functions apply finite string transformations to inputs1Richard Damon
29 Apr 25 i i i i i i i   i ii   i i i `- Re: Turing Machine computable functions apply finite string transformations to inputs1Richard Damon
28 Apr 25 i i i i i i i   i ii   i i +- Re: Turing Machine computable functions apply finite string transformations to inputs1Fred. Zwarts
29 Apr 25 i i i i i i i   i ii   i i `- Re: Turing Machine computable functions apply finite string transformations to inputs1Richard Damon
29 Apr 25 i i i i i i i   i ii   i `* Re: Turing Machine computable functions apply finite string transformations to inputs2Richard Damon
29 Apr 25 i i i i i i i   i ii   i  `- Re: Turing Machine computable functions apply finite string transformations to inputs1Richard Heathfield
28 Apr 25 i i i i i i i   i ii   +- Re: Turing Machine computable functions apply finite string transformations to inputs1joes
28 Apr 25 i i i i i i i   i ii   +* Re: Turing Machine computable functions apply finite string transformations to inputs104Richard Heathfield
28 Apr 25 i i i i i i i   i ii   i`* Re: Turing Machine computable functions apply finite string transformations to inputs103olcott
28 Apr 25 i i i i i i i   i ii   i +* Re: Turing Machine computable functions apply finite string transformations to inputs14dbush
28 Apr 25 i i i i i i i   i ii   i i`* Re: Turing Machine computable functions apply finite string transformations to inputs +++13olcott
28 Apr 25 i i i i i i i   i ii   i i `* Re: Turing Machine computable functions apply finite string transformations to inputs +++12dbush
28 Apr 25 i i i i i i i   i ii   i i  `* Re: Turing Machine computable functions apply finite string transformations to inputs +++11olcott
28 Apr 25 i i i i i i i   i ii   i i   `* Re: Turing Machine computable functions apply finite string transformations to inputs +++10dbush
28 Apr 25 i i i i i i i   i ii   i i    `* Re: Turing Machine computable functions apply finite string transformations to inputs +++9olcott
28 Apr 25 i i i i i i i   i ii   i i     +* Re: Turing Machine computable functions apply finite string transformations to inputs +++2dbush
28 Apr 25 i i i i i i i   i ii   i i     i`- Re: Turing Machine computable functions apply finite string transformations to inputs +++1Richard Heathfield
28 Apr 25 i i i i i i i   i ii   i i     +- Re: Turing Machine computable functions apply finite string transformations to inputs +++1Fred. Zwarts
28 Apr 25 i i i i i i i   i ii   i i     `* Re: Turing Machine computable functions apply finite string transformations to inputs +++5Richard Heathfield
28 Apr 25 i i i i i i i   i ii   i i      `* Re: Turing Machine computable functions apply finite string transformations to inputs +++4olcott
28 Apr 25 i i i i i i i   i ii   i i       +- Re: Turing Machine computable functions apply finite string transformations to inputs +++1dbush
28 Apr 25 i i i i i i i   i ii   i i       +- Re: Turing Machine computable functions apply finite string transformations to inputs +++1Richard Heathfield
29 Apr 25 i i i i i i i   i ii   i i       `- Re: Turing Machine computable functions apply finite string transformations to inputs +++1joes
28 Apr 25 i i i i i i i   i ii   i +* Re: Turing Machine computable functions DON'T apply finite string transformations to inputs2Alan Mackenzie
28 Apr 25 i i i i i i i   i ii   i i`- Re: Turing Machine computable functions DON'T apply finite string transformations to inputs1olcott
28 Apr 25 i i i i i i i   i ii   i `* Re: Turing Machine computable functions apply finite string transformations to inputs86Richard Heathfield
29 Apr 25 i i i i i i i   i ii   i  `* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT85olcott
29 Apr 25 i i i i i i i   i ii   i   +* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT7dbush
29 Apr 25 i i i i i i i   i ii   i   i`* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT6olcott
29 Apr 25 i i i i i i i   i ii   i   i +- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1Fred. Zwarts
29 Apr 25 i i i i i i i   i ii   i   i +- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1Richard Heathfield
29 Apr 25 i i i i i i i   i ii   i   i +- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1Richard Damon
29 Apr 25 i i i i i i i   i ii   i   i `* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT2dbush
29 Apr 25 i i i i i i i   i ii   i   i  `- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1dbush
29 Apr 25 i i i i i i i   i ii   i   +* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT65Richard Heathfield
29 Apr 25 i i i i i i i   i ii   i   i`* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT64olcott
29 Apr 25 i i i i i i i   i ii   i   i +* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT48Richard Heathfield
29 Apr 25 i i i i i i i   i ii   i   i i`* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT47olcott
29 Apr 25 i i i i i i i   i ii   i   i i +* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT45Richard Heathfield
29 Apr 25 i i i i i i i   i ii   i   i i i`* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT44olcott
29 Apr 25 i i i i i i i   i ii   i   i i i +* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT42Richard Heathfield
29 Apr 25 i i i i i i i   i ii   i   i i i i`* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT41olcott
29 Apr 25 i i i i i i i   i ii   i   i i i i +* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT39Richard Heathfield
30 Apr 25 i i i i i i i   i ii   i   i i i i i`* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT38olcott
30 Apr 25 i i i i i i i   i ii   i   i i i i i +* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT35Richard Heathfield
30 Apr 25 i i i i i i i   i ii   i   i i i i i i+* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT15olcott
30 Apr 25 i i i i i i i   i ii   i   i i i i i ii+- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1Richard Heathfield
30 Apr 25 i i i i i i i   i ii   i   i i i i i ii+- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1dbush
30 Apr 25 i i i i i i i   i ii   i   i i i i i ii+* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT11Keith Thompson
30 Apr 25 i i i i i i i   i ii   i   i i i i i iii`* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT10olcott
30 Apr 25 i i i i i i i   i ii   i   i i i i i iii `* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT9Keith Thompson
1 May 25 i i i i i i i   i ii   i   i i i i i iii  +* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT5olcott
1 May 25 i i i i i i i   i ii   i   i i i i i iii  i`* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT4Keith Thompson
1 May 25 i i i i i i i   i ii   i   i i i i i iii  i `* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT3olcott
1 May 25 i i i i i i i   i ii   i   i i i i i iii  i  +- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1dbush
1 May 25 i i i i i i i   i ii   i   i i i i i iii  i  `- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1Richard Damon
1 May 25 i i i i i i i   i ii   i   i i i i i iii  `* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT3olcott
1 May 25 i i i i i i i   i ii   i   i i i i i iii   +- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1dbush
1 May 25 i i i i i i i   i ii   i   i i i i i iii   `- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1Richard Damon
1 May 25 i i i i i i i   i ii   i   i i i i i ii`- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1Richard Damon
30 Apr 25 i i i i i i i   i ii   i   i i i i i i`* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT19Mike Terry
30 Apr 25 i i i i i i i   i ii   i   i i i i i +- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1dbush
1 May 25 i i i i i i i   i ii   i   i i i i i `- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1Richard Damon
30 Apr 25 i i i i i i i   i ii   i   i i i i `- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1Fred. Zwarts
30 Apr 25 i i i i i i i   i ii   i   i i i `- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1Fred. Zwarts
30 Apr 25 i i i i i i i   i ii   i   i i `- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1Fred. Zwarts
29 Apr 25 i i i i i i i   i ii   i   i +* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT14Fred. Zwarts
30 Apr 25 i i i i i i i   i ii   i   i `- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1Richard Damon
29 Apr 25 i i i i i i i   i ii   i   +* Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT11joes
29 Apr 25 i i i i i i i   i ii   i   `- Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT1Richard Damon
28 Apr 25 i i i i i i i   i ii   +- Re: Turing Machine computable functions apply finite string transformations to inputs1Fred. Zwarts
29 Apr 25 i i i i i i i   i ii   `- Re: Turing Machine computable functions apply finite string transformations to inputs1Richard Damon
28 Apr 25 i i i i i i i   i i`- Re: Turing Machine computable functions apply finite string transformations to inputs1Richard Heathfield
27 Apr 25 i i i i i i i   i `- Re: Turing Machine computable functions apply finite string transformations to inputs1Richard Damon
27 Apr 25 i i i i i i i   +* Re: Turing Machine computable functions apply finite string transformations to inputs7dbush
27 Apr 25 i i i i i i i   `* Re: Turing Machine computable functions apply finite string transformations to inputs24Mike Terry
27 Apr 25 i i i i i i `* Re: Turing Machine computable functions apply finite string transformations to inputs7Richard Damon
27 Apr 25 i i i i i `- Re: Turing Machine computable functions apply finite string transformations to inputs1Fred. Zwarts
26 Apr 25 i i i i `- Re: Turing Machine computable functions apply finite string transformations to inputs1Richard Damon
26 Apr 25 i i i `- Re: Turing Machine computable functions apply finite string transformations to inputs1Richard Damon
26 Apr 25 i i `- Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error1Richard Damon
25 Apr 25 i +* Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error21André G. Isaak
26 Apr 25 i `* Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error223Mikko
22 Apr 25 +* Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error4Keith Thompson
22 Apr 25 `* Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error3Richard Damon

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal