On 11/1/2025 4:58 AM, Mikko wrote:Irrelevant, as I didn't say anything about Richard; and off-topic, too.On 2025-10-31 12:47:01 +0000, olcott said:*Richard flat out lied about this*
On 10/31/2025 6:37 AM, Mikko wrote:That is much more than all we need to know about H. All we need toOn 2025-10-30 13:12:24 +0000, olcott said:All that we need to know about H is specified by this:
On 10/30/2025 5:15 AM, Mikko wrote:Olcott wrote on 2025-10-24:On 2025-10-29 16:33:58 +0000, olcott said:I am referring to D simulated by H when you change
On 10/29/2025 5:07 AM, Mikko wrote:Note that Olcott still does not answer the question, thus keepingOn 2025-10-28 15:14:07 +0000, olcott said:Not at all, it is stipulated that H does simulate
On 10/28/2025 5:03 AM, Mikko wrote:Note that the above still keeps the option to deceive with equivocation.On 2025-10-27 14:41:15 +0000, olcott said:I will simplify it for you:
On 10/27/2025 4:51 AM, Mikko wrote:Note that the above keeps the option to deceive with equivocation.On 2025-10-26 11:28:47 +0000, Tristan Wibberley said:Now that four different LLM systems have been able
On 26/10/2025 09:11, Mikko Levanto wrote:I am. Olcott does not specify as that would prevent the equivocation
HHH never dimulates more steps than there are in DD, and there id only aAre we taking that "DD" refers to a C-function that is fully defined
finite number of steps there.
because HHH has external linkage and is thus not part of the referent or
partially defined because HHH, as a callee from the referent, is part of
the referent itself?
deception that might be useful later, dependig on how others respond.
reverse-engineer the non-halting result by merely
being told to faithfully simulate DD with HHH and
see what happens this proves that all of my reviewers
have been dishonest with me for three years.
typedef int (*ptr)();
int HHH(ptr P);
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
int main()
{
HHH(DD);
}
*Halting Problem Simulation in C*
https://philpapers.org/archive/OLCHPS-2.pdf
Anyone knowing C and denying this is a liar.
int D()
{
int Halt_Status = H(D);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
H simulates D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
until H sees this repeating pattern.
D according to the semantics of the C language until
H sees that itself is stuck in recursive simulation.
the option to deceive with equivocation even though his preference
seems to be distraction by an irrelevancy.
my words to something else you are a liar.
When 0 to infinity steps of DD areOn 10/26/25 7:28 AM, Tristan Wibberley wrote:
correctly simulated by HHH the
simulated DD never reaches its own
simulated final halt state.
Are we taking that "DD" refers to a C-function that is fully definedI have answered about my use of "DD". Olcott has not answered but tried
because HHH has external linkage and is thus not part of the referent or
partially defined because HHH, as a callee from the referent, is part of
the referent itself?
to devert attention from the question.
int D()
{
int Halt_Status = H(D);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
H simulates D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
until H sees this repeating pattern
Then H returns 0 to reject its input as non-halting.
know about H is that it is not a halt decider.
--
Mikko
Les messages affichés proviennent d'usenet.