Sujet : Re: Every sufficiently competent C programmer knows --- posthumous reviewers
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 14. Mar 2025, 01:54:56
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vqvup1$59su$2@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
User-Agent : Mozilla Thunderbird
On 3/13/2025 4:15 PM, joes wrote:
Am Thu, 13 Mar 2025 15:56:22 -0500 schrieb olcott:
On 3/13/2025 4:22 AM, Mikko wrote:
On 2025-03-13 00:36:04 +0000, olcott said:
>
When HHH correctly emulates N steps of the above functions none of
them can possibly reach their own "return" instruction and terminate
normally.
>
Nevertheless, assuming HHH is a decider, Infinite_Loop and
Infinite_Recursion specify a non-terminating behaviour, DDD specifies a
terminating behaviour
>
_DDD()
[00002172] 55 push ebp ; housekeeping [00002173] 8bec
mov ebp,esp ; housekeeping [00002175] 6872210000 push 00002172 ; push
DDD [0000217a] e853f4ffff call 000015d2 ; call HHH(DDD) [0000217f]
83c404 add esp,+04 [00002182] 5d pop ebp [00002183] c3
ret Size in bytes:(0018) [00002183]
>
What is the sequence of machine language instructions of DDD emulated by
HHH such that DDD reaches its machine address 00002183?
_DDD()
[00002172] 55 push ebp ; housekeeping
[00002173] 8bec mov ebp,esp ; housekeeping
[00002175] 6872210000 push 00002172 ; push DDD
[0000217a] e853f4ffff call 000015d2 ; call HHH(DDD)
[0000217f] 83c404 add esp,+04
[00002182] 5d pop ebp
[00002183] c3 ret
Size in bytes:(0018) [00002183]
Depends on HHH, which we know 1) halts and 2) can't be simulated by
itself.
Of the infinite set every possible HHH such that N
steps of DDD are correctly emulated by each HHH it
is a verified fact to anyone with sufficient technical
competence that no DDD ever reaches its own "ret"
instruction and terminates normally.
The same thing applies to this c code:
void DDD()
{
HHH(DDD);
return;
}
Anyone knowing this and failing to affirm it will
be construed as not wanting any honest dialogue.
If people did not deny these facts for sadistic trollish
pleasure these same ideas can be applied to creating a
True(X) predicate to give LLM AI systems a foundation
anchored in facts thus eliminating AI Hallucinations.
Such a system could eventually take on every user on
every social media platform and make the Nazi lies
look utterly ridiculous to even the liars themselves.
Before it can possibly do this it much know exactly
what True(X) is And how it works. True(X) begins
with a set of stipulated truths (basic facts that
cannot be derived from other basic facts).
Haskell Curry calls these the elementary theorems:
https://www.liarparadox.org/Haskell_Curry_45.pdf-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer