On 11/2/2026 3:43 PM, Python wrote:
You JUST admitted it:<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a "Yes you are correct. We have only established that
-a-a-a HHH would be correct IF HHH did determine that."
That is the hole in your argument.
And no, these two statements do NOT mean "exactly the same thing":
-a-a WHILE HHH continues simulating DD,
-a-a DD does not reach its return.
and:
-a-a DD WOULD NEVER stop running UNLESS aborted.
The first says what happens DURING the simulation.
The second says what would happen FOREVER if the simulation were NOT
aborted.
That fucking "NEVER" is precisely what you have not established.
You cannot repair the missing proof by simply declaring:
-a-a WHILE = NEVER UNLESS ABORTED
They are not logically equivalent.
If simulating halt decider H correctly simulates its
input D until H correctly determines that its simulated D
would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
When HHH does verify that this above paragraph conditions
have been met:
*its simulated DD would never stop running unless aborted*
*is shown to be equivalent to this*
On 11/2/2026 8:50 AM, Python wrote:
WHILE THE SIMULATION CONTINUES,
DD DOES NOT REACH ITS RETURN.
WHILE THE SIMULATION CONTINUES, DD DOES NOT REACH ITS RETURN.
*by substituting synonymous terms*
stops running == HALT
reaches its return == HALT
aborted means stops being simulated
*Deriving these two equivalent statements*
its simulated DD would never HALT unless stops being simulated
WHILE THE SIMULATION CONTINUES, DD DOES NOT HALT.
Le 03/11/2026 |a 01:51, olcott a |-crit :
On 11/2/2026 6:02 PM, dart200 wrote:
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring some >>>>>>>>>>>>>> uniquely profound understanding of the "foundations of >>>>>>>>>>>>>> computation".
You cannot correctly leap to that conclusion.
Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>> semantics of DD when simulated by universal simulator (EYon as >>>>>>>>>> defined by turing), which is the halting semantics we are >>>>>>>>>> interested in:
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>> -a-a-a-a would never stop running unless aborted then
quoting sipser is not a proof polcott:
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>> -a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D
-a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the
conclusion rests upon a statement made by some presumed authority or
witness... Because the testimony of a qualified authority or witness
provides a reason for believing a claim, such arguments are often
inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D
would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a If simulating halt decider H correctly simulates its
-a-a input D until H correctly determines that its simulated D
-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring some >>>>>>>>>>>>>>> uniquely profound understanding of the "foundations of >>>>>>>>>>>>>>> computation".
You cannot correctly leap to that conclusion.
Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon as >>>>>>>>>>> defined by turing), which is the halting semantics we are >>>>>>>>>>> interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>> -a-a-a-a would never stop running unless aborted then
quoting sipser is not a proof polcott:
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>>> -a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the
conclusion rests upon a statement made by some presumed authority or
witness... Because the testimony of a qualified authority or witness
provides a reason for believing a claim, such arguments are often
inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D
would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring some >>>>>>>>>>>>>>> uniquely profound understanding of the "foundations of >>>>>>>>>>>>>>> computation".
You cannot correctly leap to that conclusion.
Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon as >>>>>>>>>>> defined by turing), which is the halting semantics we are >>>>>>>>>>> interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>> -a-a-a-a would never stop running unless aborted then
quoting sipser is not a proof polcott:
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>>> -a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the
conclusion rests upon a statement made by some presumed authority or
witness... Because the testimony of a qualified authority or witness
provides a reason for believing a claim, such arguments are often
inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D
would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
Le 03/11/2026 |a 01:51, olcott a |-crit :
On 11/2/2026 3:43 PM, Python wrote:
You JUST admitted it:<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a "Yes you are correct. We have only established that
-a-a-a-a HHH would be correct IF HHH did determine that."
That is the hole in your argument.
And no, these two statements do NOT mean "exactly the same thing":
-a-a-a WHILE HHH continues simulating DD,
-a-a-a DD does not reach its return.
and:
-a-a-a DD WOULD NEVER stop running UNLESS aborted.
The first says what happens DURING the simulation.
The second says what would happen FOREVER if the simulation were NOT
aborted.
That fucking "NEVER" is precisely what you have not established.
You cannot repair the missing proof by simply declaring:
-a-a-a WHILE = NEVER UNLESS ABORTED
They are not logically equivalent.
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
When HHH does verify that this above paragraph conditions
have been met:
*its simulated DD would never stop running unless aborted*
*is shown to be equivalent to this*
On 11/2/2026 8:50 AM, Python wrote:
WHILE THE SIMULATION CONTINUES,
DD DOES NOT REACH ITS RETURN.
WHILE THE SIMULATION CONTINUES, DD DOES NOT REACH ITS RETURN.
*by substituting synonymous terms*
stops running == HALT
reaches its return == HALT
aborted means stops being simulated
*Deriving these two equivalent statements*
its simulated DD would never HALT unless stops being simulated
WHILE THE SIMULATION CONTINUES, DD DOES NOT HALT.
NO, Peter. This is now pure circular bullshit.
You write:
-a-a "When HHH does verify that these above paragraph
-a-a-a conditions have been met"
STOP RIGHT FUCKING THERE.
THAT IS THE THING YOU HAVE NOT PROVED.
Sipser's premise is:
-a-a H CORRECTLY DETERMINES that D
-a-a WOULD NEVER stop running unless aborted.
Your established statement is:
-a-a WHILE THE SIMULATION CONTINUES,
-a-a DD DOES NOT REACH ITS RETURN.
And now you claim they are equivalent by "substituting synonymous terms."
They fucking aren't.
The vocabulary is not the problem.
Yes:
-a-a stops running ~= halts
-a-a reaches its return ~= halts
-a-a aborted ~= stops being simulated
None of those substitutions manufactures the missing temporal quantifier:
-a-a NEVER.
Let's strip away every distracting word.
You have:
-a-a WHILE X, NOT Y.
You need:
-a-a IF X IS NEVER TERMINATED, Y NEVER OCCURS.
Those are NOT equivalent merely by substituting synonyms.
The first describes what is true while X continues.
The second makes a claim about the ENTIRE hypothetical future in which X continues indefinitely.
THAT IS THE FUCKING PROPOSITION YOU HAVE TO PROVE.
And your latest argument is literally:
-a-a 1. IF H correctly determines NEVER, Sipser says the result is correct.
-a-a 2. Assume HHH has verified that condition.
-a-a 3. Therefore HHH has correctly determined NEVER.
That is not a proof.
THAT IS ASSUMING THE FUCKING PREMISE.
Worse, you JUST admitted this yourself:
-a-a "We have only established that
-a-a-a HHH would be correct IF HHH did determine that."
Correct.
IF.
So stop quoting Sipser.
Stop substituting synonyms.
Stop repeating my qualified agreement.
Stop declaring the unproved condition "verified."
SHOW THE INFERENCE:
-a-a WHILE HHH SIMULATES DD,
-a-a DD HAS NOT HALTED
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a |
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a |-a PROVE THIS FUCKING ARROW
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a v
-a-a IF HHH CONTINUED SIMULATING DD FOREVER,
-a-a DD WOULD NEVER HALT.
Until you prove that arrow, you have not established Sipser's premise.
You have merely written the conclusion you need into the phrase:
-a-a "HHH does verify"
and then congratulated yourself for deriving it.
That is textbook begging the question.
AND ONE MORE THING:
STOP USING MY QUOTATION AS IF IT SUPPORTED YOUR STRONGER CLAIM.
I have now told you REPEATEDLY and EXPLICITLY that my agreement is
limited to:
-a-a WHILE THE SIMULATION CONTINUES,
-a-a DD DOES NOT REACH ITS RETURN.
I explicitly DO NOT agree that this entails:
-a-a DD WOULD NEVER HALT UNLESS ABORTED.
Yet you keep quoting my words immediately before asserting YOUR
purported equivalence, creating the impression that my agreement lends support to it.
IT DOES NOT.
You have been corrected about this too many times for "misunderstanding"
to remain a credible excuse.
Quote me if necessary to preserve the thread context.
But DO NOT PRESENT MY WORDS AS EVIDENCE, AGREEMENT, CONSENSUS, OR
SUPPORT FOR YOUR "NEVER UNLESS ABORTED" CLAIM.
That claim is YOURS.
The missing proof is YOURS.
My name does not belong on it.
On 02/11/2026 00:36, Python wrote:
You have STILL advanced exactly ZERO steps.
You started with:
-a-a-a simulated DD never reaches its final return state
-a-a-a in any finite number of steps
and now conclude:
-a-a-a simulated DD never halts
-a-a-a in any finite number of steps
because "halting" means reaching a final state.
Fine.
THAT IS STILL THE SAME FUCKING PROPOSITION.
Now comes the part you keep avoiding:
How does HHH, which is supposed to be a HALT DECIDER, terminate and
return 0 to DD?
If HHH(DD) never returns, then HHH is not a terminating halt decider
on DD.
If HHH(DD) returns 0, then DD executes:
-a-a-a return Halt_Status;
and halts.
If HHH(DD) returns 1, DD loops.
Those are the three cases.
So your endless rewriting of:
-a-a-a "DD does not reach its final state while HHH keeps simulating it"
does not refute the Halting Theorem.
It merely describes the case in which HHH DOES NOT RETURN.
I'm not sure you're understanding the situation correctly...
I mean, "DD does not reach its final state while HHH keeps simulating
it" correctly describes the situation where HHH never aborts,
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring some >>>>>>>>>>>>>>> uniquely profound understanding of the "foundations of >>>>>>>>>>>>>>> computation".
You cannot correctly leap to that conclusion.
Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon as >>>>>>>>>>> defined by turing), which is the halting semantics we are >>>>>>>>>>> interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>> -a-a-a-a would never stop running unless aborted then
quoting sipser is not a proof polcott:
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>>> -a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the
conclusion rests upon a statement made by some presumed authority or
witness... Because the testimony of a qualified authority or witness
provides a reason for believing a claim, such arguments are often
inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D
would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
the "then" refers to aborting after the recursion is detected. sipser provides an exception to the correctness of the decision, explicitly if
the simulation is _then_ aborted after the determination is made. this
is what HHH does, and therefore the analysis by HHH of DD is invalidated
it sucks to be wrong polcott, but it's better to admit ur wrong than continue being wrong, this is know from experience
On 11/2/2026 5:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:It kind of looks like you just posted an appeal to authority - Alan Turing.
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring some >>>>>>>>>>>>>>>> uniquely profound understanding of the "foundations of >>>>>>>>>>>>>>>> computation".
You cannot correctly leap to that conclusion.
Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon as >>>>>>>>>>>> defined by turing), which is the halting semantics we are >>>>>>>>>>>> interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>>> -a-a-a-a would never stop running unless aborted then
quoting sipser is not a proof polcott:
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the
conclusion rests upon a statement made by some presumed authority
or witness... Because the testimony of a qualified authority or
witness provides a reason for believing a claim, such arguments are >>>>> often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D
would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
the "then" refers to aborting after the recursion is detected. sipser
provides an exception to the correctness of the decision, explicitly
if the simulation is _then_ aborted after the determination is made.
this is what HHH does, and therefore the analysis by HHH of DD is
invalidated
it sucks to be wrong polcott, but it's better to admit ur wrong than
continue being wrong, this is know from experience
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring some >>>>>>>>>>>>>>>> uniquely profound understanding of the "foundations of >>>>>>>>>>>>>>>> computation".
You cannot correctly leap to that conclusion.
Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon as >>>>>>>>>>>> defined by turing), which is the halting semantics we are >>>>>>>>>>>> interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>>> -a-a-a-a would never stop running unless aborted then
quoting sipser is not a proof polcott:
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the
conclusion rests upon a statement made by some presumed authority
or witness... Because the testimony of a qualified authority or
witness provides a reason for believing a claim, such arguments are >>>>> often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D
would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring some >>>>>>>>>>>>>>> uniquely profound understanding of the "foundations of >>>>>>>>>>>>>>> computation".
You cannot correctly leap to that conclusion.
Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon as >>>>>>>>>>> defined by turing), which is the halting semantics we are >>>>>>>>>>> interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>> -a-a-a-a would never stop running unless aborted then
quoting sipser is not a proof polcott:
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>>> -a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the
conclusion rests upon a statement made by some presumed authority or
witness... Because the testimony of a qualified authority or witness
provides a reason for believing a claim, such arguments are often
inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D
would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
the "then" refers to aborting after the recursion is detected. sipser provides an exception to the correctness of the decision, explicitly if
the simulation is _then_ aborted after the determination is made. this
is what HHH does, and therefore the analysis by HHH of DD is invalidated
it sucks to be wrong polcott, but it's better to admit ur wrong than continue being wrong, this is know from experience
On 11/2/26 5:17 PM, olcott wrote:
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring >>>>>>>>>>>>>>>>> some uniquely profound understanding of the >>>>>>>>>>>>>>>>> "foundations of computation".
You cannot correctly leap to that conclusion.
Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon as >>>>>>>>>>>>> defined by turing), which is the halting semantics we are >>>>>>>>>>>>> interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>>>> -a-a-a-a would never stop running unless aborted then
quoting sipser is not a proof polcott:
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the >>>>>> conclusion rests upon a statement made by some presumed authority >>>>>> or witness... Because the testimony of a qualified authority or
witness provides a reason for believing a claim, such arguments
are often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D
would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
sipser himself only agreed that H is correct *unless DD is aborted then*
ur actively ignoring the conditional on the proof, which is that H is correct if and only if D is then not aborted...
HHH aborts DD's simulation, so therefore the analysis HHH makes prior to
the abort is invalidated
ur can write me off a useless troll all u want, but i'm still going to
try to post helpful comments polcott. and i suggest that ignoring the conditional is a major flaw in what ur trying to propose atm
On 11/2/26 5:17 PM, olcott wrote:
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring >>>>>>>>>>>>>>>>> some uniquely profound understanding of the >>>>>>>>>>>>>>>>> "foundations of computation".
You cannot correctly leap to that conclusion.
Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon as >>>>>>>>>>>>> defined by turing), which is the halting semantics we are >>>>>>>>>>>>> interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>>>> -a-a-a-a would never stop running unless aborted then
quoting sipser is not a proof polcott:
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the >>>>>> conclusion rests upon a statement made by some presumed authority >>>>>> or witness... Because the testimony of a qualified authority or
witness provides a reason for believing a claim, such arguments
are often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D
would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
sipser himself only agreed that H is correct *unless DD is aborted then*
ur actively ignoring the conditional on the proof, which is that H is correct if and only if D is then not aborted...
HHH aborts DD's simulation, so therefore the analysis HHH makes prior to
the abort is invalidated
ur can write me off a useless troll all u want, but i'm still going to
try to post helpful comments polcott. and i suggest that ignoring the conditional is a major flaw in what ur trying to propose atm
On 11/2/2026 11:08 PM, dart200 wrote:
On 11/2/26 5:17 PM, olcott wrote:
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:quoting sipser is not a proof polcott:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring >>>>>>>>>>>>>>>>>> some uniquely profound understanding of the >>>>>>>>>>>>>>>>>> "foundations of computation".
You cannot correctly leap to that conclusion. >>>>>>>>>>>>>>>>> Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon >>>>>>>>>>>>>> as defined by turing), which is the halting semantics we >>>>>>>>>>>>>> are interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the >>>>>>> conclusion rests upon a statement made by some presumed authority >>>>>>> or witness... Because the testimony of a qualified authority or >>>>>>> witness provides a reason for believing a claim, such arguments >>>>>>> are often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D >>>>>> would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>> -a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
sipser himself only agreed that H is correct *unless DD is aborted then*
ur actively ignoring the conditional on the proof, which is that H is
correct if and only if D is then not aborted...
HHH aborts DD's simulation, so therefore the analysis HHH makes prior
to the abort is invalidated
ur can write me off a useless troll all u want, but i'm still going to
try to post helpful comments polcott. and i suggest that ignoring the
conditional is a major flaw in what ur trying to propose atm
Why the fuck do you add those two groups
alt.buddha.short.fat.guy
alt.messianic
Have you always only been a troll?
On 11/2/2026 11:08 PM, dart200 wrote:
On 11/2/26 5:17 PM, olcott wrote:
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:quoting sipser is not a proof polcott:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring >>>>>>>>>>>>>>>>>> some uniquely profound understanding of the >>>>>>>>>>>>>>>>>> "foundations of computation".
You cannot correctly leap to that conclusion. >>>>>>>>>>>>>>>>> Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon >>>>>>>>>>>>>> as defined by turing), which is the halting semantics we >>>>>>>>>>>>>> are interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the >>>>>>> conclusion rests upon a statement made by some presumed authority >>>>>>> or witness... Because the testimony of a qualified authority or >>>>>>> witness provides a reason for believing a claim, such arguments >>>>>>> are often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D >>>>>> would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>> -a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
sipser himself only agreed that H is correct *unless DD is aborted then*
That is a completely dishonest paraphrase.
I spent two years coming up with those words
knowing his phone number the whole time. I
did not call until I got them right.
ur actively ignoring the conditional on the proof, which is that H is
correct if and only if D is then not aborted...
its simulated DD would never HALT unless stops being simulated
HHH aborts DD's simulation, so therefore the analysis HHH makes prior
to the abort is invalidated
ur can write me off a useless troll all u want, but i'm still going to
try to post helpful comments polcott. and i suggest that ignoring the
conditional is a major flaw in what ur trying to propose atm
On 11/2/2026 11:08 PM, dart200 wrote:
On 11/2/26 5:17 PM, olcott wrote:
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:quoting sipser is not a proof polcott:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring >>>>>>>>>>>>>>>>>> some uniquely profound understanding of the >>>>>>>>>>>>>>>>>> "foundations of computation".
You cannot correctly leap to that conclusion. >>>>>>>>>>>>>>>>> Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon >>>>>>>>>>>>>> as defined by turing), which is the halting semantics we >>>>>>>>>>>>>> are interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the >>>>>>> conclusion rests upon a statement made by some presumed authority >>>>>>> or witness... Because the testimony of a qualified authority or >>>>>>> witness provides a reason for believing a claim, such arguments >>>>>>> are often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D >>>>>> would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>> -a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
sipser himself only agreed that H is correct *unless DD is aborted then*
ur actively ignoring the conditional on the proof, which is that H is
correct if and only if D is then not aborted...
HHH aborts DD's simulation, so therefore the analysis HHH makes prior
to the abort is invalidated
ur can write me off a useless troll all u want, but i'm still going to
try to post helpful comments polcott. and i suggest that ignoring the
conditional is a major flaw in what ur trying to propose atm
Why the fuck do you add those two groups
alt.buddha.short.fat.guy''
alt.messianic
Have you always only been a troll?
On 11/1/2026 8:09 PM, Mike Terry wrote:
On 02/11/2026 00:36, Python wrote:
You have STILL advanced exactly ZERO steps.
You started with:
-a-a-a simulated DD never reaches its final return state
-a-a-a in any finite number of steps
and now conclude:
-a-a-a simulated DD never halts
-a-a-a in any finite number of steps
because "halting" means reaching a final state.
Fine.
THAT IS STILL THE SAME FUCKING PROPOSITION.
Now comes the part you keep avoiding:
How does HHH, which is supposed to be a HALT DECIDER, terminate and
return 0 to DD?
If HHH(DD) never returns, then HHH is not a terminating halt decider
on DD.
If HHH(DD) returns 0, then DD executes:
-a-a-a return Halt_Status;
and halts.
If HHH(DD) returns 1, DD loops.
Those are the three cases.
So your endless rewriting of:
-a-a-a "DD does not reach its final state while HHH keeps simulating it" >>>
does not refute the Halting Theorem.
It merely describes the case in which HHH DOES NOT RETURN.
I'm not sure you're understanding the situation correctly...
I mean, "DD does not reach its final state while HHH keeps simulating
it" correctly describes the situation where HHH never aborts,
01 int DD()
02 {
03-a-a int Halt_Status = HHH(DD);
04-a-a if (Halt_Status)
05-a-a-a-a HERE: goto HERE;
06-a-a return Halt_Status;
07 }
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
On 2026-11-02 19:54, olcott wrote:
On 11/1/2026 8:09 PM, Mike Terry wrote:
On 02/11/2026 00:36, Python wrote:
You have STILL advanced exactly ZERO steps.
You started with:
-a-a-a simulated DD never reaches its final return state
-a-a-a in any finite number of steps
and now conclude:
-a-a-a simulated DD never halts
-a-a-a in any finite number of steps
because "halting" means reaching a final state.
Fine.
THAT IS STILL THE SAME FUCKING PROPOSITION.
Now comes the part you keep avoiding:
How does HHH, which is supposed to be a HALT DECIDER, terminate and
return 0 to DD?
If HHH(DD) never returns, then HHH is not a terminating halt decider
on DD.
If HHH(DD) returns 0, then DD executes:
-a-a-a return Halt_Status;
and halts.
If HHH(DD) returns 1, DD loops.
Those are the three cases.
So your endless rewriting of:
-a-a-a "DD does not reach its final state while HHH keeps simulating it" >>>>
does not refute the Halting Theorem.
It merely describes the case in which HHH DOES NOT RETURN.
I'm not sure you're understanding the situation correctly...
I mean, "DD does not reach its final state while HHH keeps simulating
it" correctly describes the situation where HHH never aborts,
01 int DD()
02 {
03-a-a int Halt_Status = HHH(DD);
04-a-a if (Halt_Status)
05-a-a-a-a HERE: goto HERE;
06-a-a return Halt_Status;
07 }
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D
-a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a new
instance of HHH (call it HHH_1). HHH_1 then simulates a new instance of DD_1, which in turn calls HHH_2 and so forth.
But that chain doesn't continue indefinitely.
Bear in mind that in the above chain, only the outermost HHH counts as 'simulating halt decider H' according to the Sipser criterion. HHH_1,
HHH_2 and so on are not the halt decider. They are simply part of DD,
the program under test. And if HHH_1 aborts its input, DD_1, that
doesn't count as being aborted by the *halt decider*. HHH_1 is simply terminating according to its own rules.
Your HHH decides it needs to abort DD, but that decision is incorrect
since if HHH did *not* abort D, HHH_1 invoked inside DD would have eventually aborted DD_1, at which point control would be returned to DD which would then execute its return instruction.
So HHH does not *correctly* determine that its input would not terminate unless aborted. It uses incorrect logic to prematurely abort DD.
If your HHH did not include conditional code to abort its simulating,
then you would have an infinitely recursive chain. But in that case the outermost HHH would never return a result so it wouldn't count as a halt decider.
As it stands, your outermost HHH returns nonhalting for an input that
*is* halting, so it also doesn't count as a halt decider.
Andr|-
On 11/3/2026 10:35 AM, Andr|- G. Isaak wrote:
On 2026-11-02 19:54, olcott wrote:
On 11/1/2026 8:09 PM, Mike Terry wrote:
On 02/11/2026 00:36, Python wrote:
You have STILL advanced exactly ZERO steps.
You started with:
-a-a-a simulated DD never reaches its final return state
-a-a-a in any finite number of steps
and now conclude:
-a-a-a simulated DD never halts
-a-a-a in any finite number of steps
because "halting" means reaching a final state.
Fine.
THAT IS STILL THE SAME FUCKING PROPOSITION.
Now comes the part you keep avoiding:
How does HHH, which is supposed to be a HALT DECIDER, terminate and >>>>> return 0 to DD?
If HHH(DD) never returns, then HHH is not a terminating halt
decider on DD.
If HHH(DD) returns 0, then DD executes:
-a-a-a return Halt_Status;
and halts.
If HHH(DD) returns 1, DD loops.
Those are the three cases.
So your endless rewriting of:
-a-a-a "DD does not reach its final state while HHH keeps simulating it" >>>>>
does not refute the Halting Theorem.
It merely describes the case in which HHH DOES NOT RETURN.
I'm not sure you're understanding the situation correctly...
I mean, "DD does not reach its final state while HHH keeps
simulating it" correctly describes the situation where HHH never
aborts,
01 int DD()
02 {
03-a-a int Halt_Status = HHH(DD);
04-a-a if (Halt_Status)
05-a-a-a-a HERE: goto HERE;
06-a-a return Halt_Status;
07 }
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D
-a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a new
instance of HHH (call it HHH_1). HHH_1 then simulates a new instance
of DD_1, which in turn calls HHH_2 and so forth.
But that chain doesn't continue indefinitely.
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
*Proves that this is true*^^^^^^^^^^^^^^
If simulating halt decider H correctly simulates its
input D until [we can see] that its simulated D would
never stop running unless aborted
Bear in mind that in the above chain, only the outermost HHH counts as
'simulating halt decider H' according to the Sipser criterion. HHH_1,
HHH_2 and so on are not the halt decider. They are simply part of DD,
the program under test. And if HHH_1 aborts its input, DD_1, that
doesn't count as being aborted by the *halt decider*. HHH_1 is simply
terminating according to its own rules.
Your HHH decides it needs to abort DD, but that decision is incorrect
since if HHH did *not* abort D, HHH_1 invoked inside DD would have
eventually aborted DD_1, at which point control would be returned to
DD which would then execute its return instruction.
So HHH does not *correctly* determine that its input would not
terminate unless aborted. It uses incorrect logic to prematurely abort
DD.
If your HHH did not include conditional code to abort its simulating,
then you would have an infinitely recursive chain. But in that case
the outermost HHH would never return a result so it wouldn't count as
a halt decider.
As it stands, your outermost HHH returns nonhalting for an input that
*is* halting, so it also doesn't count as a halt decider.
Andr|-
On 11/3/26 8:47 AM, olcott wrote:
On 11/3/2026 10:35 AM, Andr|- G. Isaak wrote:
On 2026-11-02 19:54, olcott wrote:
On 11/1/2026 8:09 PM, Mike Terry wrote:
On 02/11/2026 00:36, Python wrote:
You have STILL advanced exactly ZERO steps.
You started with:
-a-a-a simulated DD never reaches its final return state
-a-a-a in any finite number of steps
and now conclude:
-a-a-a simulated DD never halts
-a-a-a in any finite number of steps
because "halting" means reaching a final state.
Fine.
THAT IS STILL THE SAME FUCKING PROPOSITION.
Now comes the part you keep avoiding:
How does HHH, which is supposed to be a HALT DECIDER, terminate and >>>>> return 0 to DD?
If HHH(DD) never returns, then HHH is not a terminating halt
decider on DD.
If HHH(DD) returns 0, then DD executes:
-a-a-a return Halt_Status;
and halts.
If HHH(DD) returns 1, DD loops.
Those are the three cases.
So your endless rewriting of:
-a-a-a "DD does not reach its final state while HHH keeps simulating it"
does not refute the Halting Theorem.
It merely describes the case in which HHH DOES NOT RETURN.
I'm not sure you're understanding the situation correctly...
I mean, "DD does not reach its final state while HHH keeps
simulating it" correctly describes the situation where HHH never
aborts,
01 int DD()
02 {
03-a-a int Halt_Status = HHH(DD);
04-a-a if (Halt_Status)
05-a-a-a-a HERE: goto HERE;
06-a-a return Halt_Status;
07 }
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D
-a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a new
instance of HHH (call it HHH_1). HHH_1 then simulates a new instance
of DD_1, which in turn calls HHH_2 and so forth.
But that chain doesn't continue indefinitely.
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
true, the halting theorem is thus demonstrated
*Proves that this is true*^^^^^^^^^^^^^^
If simulating halt decider H correctly simulates its
input D until [we can see] that its simulated D would
never stop running unless aborted
HHH does abort DD, so DD is not a non-termating machine
ur not gunna bust down the halting theorem for turing machines polcott,
fine some other door to go down...
while i agree with the sentiment there is something highly suspicious
about the fact we can externally prove infinite recursion immediately
based on witnessing a machine doing self-recursion (call itself) ... the algo does not work generally within machine and ur example proves it.
the door i'm interested in is the ct-thesis
the ct-thesis is not proven, so we don't need to refute any known
proofs... we just need to show how we humans can compute some sequence
that a machine cannot due to the halting theorem preventing it from doing so
Bear in mind that in the above chain, only the outermost HHH counts as
'simulating halt decider H' according to the Sipser criterion. HHH_1,
HHH_2 and so on are not the halt decider. They are simply part of DD,
the program under test. And if HHH_1 aborts its input, DD_1, that
doesn't count as being aborted by the *halt decider*. HHH_1 is simply
terminating according to its own rules.
Your HHH decides it needs to abort DD, but that decision is incorrect
since if HHH did *not* abort D, HHH_1 invoked inside DD would have
eventually aborted DD_1, at which point control would be returned to
DD which would then execute its return instruction.
So HHH does not *correctly* determine that its input would not
terminate unless aborted. It uses incorrect logic to prematurely abort
DD.
If your HHH did not include conditional code to abort its simulating,
then you would have an infinitely recursive chain. But in that case
the outermost HHH would never return a result so it wouldn't count as
a halt decider.
As it stands, your outermost HHH returns nonhalting for an input that
*is* halting, so it also doesn't count as a halt decider.
Andr|-
On 11/3/2026 10:35 AM, Andr|- G. Isaak wrote:
On 2026-11-02 19:54, olcott wrote:
On 11/1/2026 8:09 PM, Mike Terry wrote:
On 02/11/2026 00:36, Python wrote:
You have STILL advanced exactly ZERO steps.
You started with:
-a-a-a simulated DD never reaches its final return state
-a-a-a in any finite number of steps
and now conclude:
-a-a-a simulated DD never halts
-a-a-a in any finite number of steps
because "halting" means reaching a final state.
Fine.
THAT IS STILL THE SAME FUCKING PROPOSITION.
Now comes the part you keep avoiding:
How does HHH, which is supposed to be a HALT DECIDER, terminate and >>>>> return 0 to DD?
If HHH(DD) never returns, then HHH is not a terminating halt
decider on DD.
If HHH(DD) returns 0, then DD executes:
-a-a-a return Halt_Status;
and halts.
If HHH(DD) returns 1, DD loops.
Those are the three cases.
So your endless rewriting of:
-a-a-a "DD does not reach its final state while HHH keeps simulating it" >>>>>
does not refute the Halting Theorem.
It merely describes the case in which HHH DOES NOT RETURN.
I'm not sure you're understanding the situation correctly...
I mean, "DD does not reach its final state while HHH keeps
simulating it" correctly describes the situation where HHH never
aborts,
01 int DD()
02 {
03-a-a int Halt_Status = HHH(DD);
04-a-a if (Halt_Status)
05-a-a-a-a HERE: goto HERE;
06-a-a return Halt_Status;
07 }
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D
-a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a new
instance of HHH (call it HHH_1). HHH_1 then simulates a new instance
of DD_1, which in turn calls HHH_2 and so forth.
But that chain doesn't continue indefinitely.
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
*Proves that this is true*
If simulating halt decider H correctly simulates its
input D until [we can see] that its simulated D would
never stop running unless aborted
--Bear in mind that in the above chain, only the outermost HHH counts as
'simulating halt decider H' according to the Sipser criterion. HHH_1,
HHH_2 and so on are not the halt decider. They are simply part of DD,
the program under test. And if HHH_1 aborts its input, DD_1, that
doesn't count as being aborted by the *halt decider*. HHH_1 is simply
terminating according to its own rules.
Your HHH decides it needs to abort DD, but that decision is incorrect
since if HHH did *not* abort D, HHH_1 invoked inside DD would have
eventually aborted DD_1, at which point control would be returned to
DD which would then execute its return instruction.
So HHH does not *correctly* determine that its input would not
terminate unless aborted. It uses incorrect logic to prematurely abort
DD.
If your HHH did not include conditional code to abort its simulating,
then you would have an infinitely recursive chain. But in that case
the outermost HHH would never return a result so it wouldn't count as
a halt decider.
As it stands, your outermost HHH returns nonhalting for an input that
*is* halting, so it also doesn't count as a halt decider.
On 2026-11-03 09:47, olcott wrote:
On 11/3/2026 10:35 AM, Andr|- G. Isaak wrote:
On 2026-11-02 19:54, olcott wrote:
On 11/1/2026 8:09 PM, Mike Terry wrote:
On 02/11/2026 00:36, Python wrote:
You have STILL advanced exactly ZERO steps.
You started with:
-a-a-a simulated DD never reaches its final return state
-a-a-a in any finite number of steps
and now conclude:
-a-a-a simulated DD never halts
-a-a-a in any finite number of steps
because "halting" means reaching a final state.
Fine.
THAT IS STILL THE SAME FUCKING PROPOSITION.
Now comes the part you keep avoiding:
How does HHH, which is supposed to be a HALT DECIDER, terminate
and return 0 to DD?
If HHH(DD) never returns, then HHH is not a terminating halt
decider on DD.
If HHH(DD) returns 0, then DD executes:
-a-a-a return Halt_Status;
and halts.
If HHH(DD) returns 1, DD loops.
Those are the three cases.
So your endless rewriting of:
-a-a-a "DD does not reach its final state while HHH keeps simulating it" >>>>>>
does not refute the Halting Theorem.
It merely describes the case in which HHH DOES NOT RETURN.
I'm not sure you're understanding the situation correctly...
I mean, "DD does not reach its final state while HHH keeps
simulating it" correctly describes the situation where HHH never
aborts,
01 int DD()
02 {
03-a-a int Halt_Status = HHH(DD);
04-a-a if (Halt_Status)
05-a-a-a-a HERE: goto HERE;
06-a-a return Halt_Status;
07 }
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D
-a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a new
instance of HHH (call it HHH_1). HHH_1 then simulates a new instance
of DD_1, which in turn calls HHH_2 and so forth.
But that chain doesn't continue indefinitely.
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
Your simply repeating yourself without actually addressing my point. DD
*would* reach its own return call had it not been prematurely aborted by HHH. DD would reach its own return address because the HHH_1 called from within DD would eventually abort its input at which point HHH_1 would
return control to DD which would then terminate normally.
Andr|-
*Proves that this is true*
If simulating halt decider H correctly simulates its
input D until [we can see] that its simulated D would
never stop running unless aborted
Bear in mind that in the above chain, only the outermost HHH counts
as 'simulating halt decider H' according to the Sipser criterion.
HHH_1, HHH_2 and so on are not the halt decider. They are simply part
of DD, the program under test. And if HHH_1 aborts its input, DD_1,
that doesn't count as being aborted by the *halt decider*. HHH_1 is
simply terminating according to its own rules.
Your HHH decides it needs to abort DD, but that decision is incorrect
since if HHH did *not* abort D, HHH_1 invoked inside DD would have
eventually aborted DD_1, at which point control would be returned to
DD which would then execute its return instruction.
So HHH does not *correctly* determine that its input would not
terminate unless aborted. It uses incorrect logic to prematurely
abort DD.
If your HHH did not include conditional code to abort its simulating,
then you would have an infinitely recursive chain. But in that case
the outermost HHH would never return a result so it wouldn't count as
a halt decider.
As it stands, your outermost HHH returns nonhalting for an input that
*is* halting, so it also doesn't count as a halt decider.
On 11/3/2026 12:20 PM, Andr|- G. Isaak wrote:
On 2026-11-03 09:47, olcott wrote:
On 11/3/2026 10:35 AM, Andr|- G. Isaak wrote:
On 2026-11-02 19:54, olcott wrote:
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>> -a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D
-a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a new
instance of HHH (call it HHH_1). HHH_1 then simulates a new instance
of DD_1, which in turn calls HHH_2 and so forth.
But that chain doesn't continue indefinitely.
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
Your simply repeating yourself without actually addressing my point. DD
We already have a five-way consensus on the above words, quit cheating.
On 2026-11-03 12:03, olcott wrote:
On 11/3/2026 12:20 PM, Andr|- G. Isaak wrote:
On 2026-11-03 09:47, olcott wrote:
On 11/3/2026 10:35 AM, Andr|- G. Isaak wrote:
On 2026-11-02 19:54, olcott wrote:
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>>> -a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>> -a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a new
instance of HHH (call it HHH_1). HHH_1 then simulates a new
instance of DD_1, which in turn calls HHH_2 and so forth.
But that chain doesn't continue indefinitely.
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
Your simply repeating yourself without actually addressing my point. DD
We already have a five-way consensus on the above words, quit cheating.
There appears to be a disconnect between what others have agreed to and
what you *think* they have agreed to. Python has pointed this out to you numerous times.
WHILE THE SIMULATION CONTINUES,
DD DOES NOT REACH ITS RETURN.
Pointing out a flaw in your reasoning hardly constitutes 'cheating'.
Maybe actually address the point.
Andr|-
On 11/2/26 9:24 PM, olcott wrote:
On 11/2/2026 11:08 PM, dart200 wrote:
On 11/2/26 5:17 PM, olcott wrote:
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:quoting sipser is not a proof polcott:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring >>>>>>>>>>>>>>>>>>> some uniquely profound understanding of the >>>>>>>>>>>>>>>>>>> "foundations of computation".
You cannot correctly leap to that conclusion. >>>>>>>>>>>>>>>>>> Hypothesize this and I will prove it later: >>>>>>>>>>>>>>>>>>
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts >>>>>>>>>>>>>>>>>
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the >>>>>>>>>>>>>>> halting semantics of DD when simulated by universal >>>>>>>>>>>>>>> simulator (EYon as defined by turing), which is the halting >>>>>>>>>>>>>>> semantics we are interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its >>>>>>>>>>>>>> simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>>
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted >>>>>>>>>>>>
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>> 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which >>>>>>>> the conclusion rests upon a statement made by some presumed
authority or witness... Because the testimony of a qualified
authority or witness provides a reason for believing a claim, >>>>>>>> such arguments are often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D >>>>>>> would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>>> -a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
sipser himself only agreed that H is correct *unless DD is aborted then* >>>
That is a completely dishonest paraphrase.
I spent two years coming up with those words
knowing his phone number the whole time. I
did not call until I got them right.
ur actively ignoring the conditional on the proof, which is that H is
correct if and only if D is then not aborted...
its simulated DD would never HALT unless stops being simulated
yes DD _would_ never HALT _unless_ HHH aborts it
_would_ implies a hypothetical based on a conditional, in this case that
HHH does _not_ abort it
HHH however does abort DD, violating the required condition (that HHH
does _not_ abort it) for HHH to truthfully prove that DD is a non- terminating machine
HHH aborts DD's simulation, so therefore the analysis HHH makes prior
to the abort is invalidated
ur can write me off a useless troll all u want, but i'm still going
to try to post helpful comments polcott. and i suggest that ignoring
the conditional is a major flaw in what ur trying to propose atm
Peter,
FOR FUCK'S SAKE. YOU ARE DOING IT AGAIN.
Andr|- writes:
-a-a "There appears to be a disconnect between what others
-a-a-a have agreed to and what you *think* they have agreed to.
-a-a-a Python has pointed this out to you numerous times."
And what do you do?
YOU QUOTE ME AGAIN.
-a-a WHILE THE SIMULATION CONTINUES,
-a-a DD DOES NOT REACH ITS RETURN.
Yes, Peter. THOSE ARE MY WORDS.
And I have told you, repeatedly, explicitly, and in capital letters,
that my agreement is LIMITED TO THAT STATEMENT.
It does NOT establish that HHH correctly determines non-halting.
It does NOT establish your claimed equivalence with "WOULD NEVER HALT
UNLESS ABORTED".
It does NOT establish Sipser's premise.
And it most certainly does NOT refute the Halting Theorem.
Yet you keep reproducing my quotation whenever someone challenges your reasoning, as though my agreement were evidence in your favor.
IT IS NOT.
And now:
-a-a "dbush helped write the prior version."
SO FUCKING WHAT?
Helping formulate a proposition does not constitute agreement with every conclusion YOU subsequently claim follows from it.
You have been explicitly warned about this distinction, by me and now by Andr|-.
Your "five-way consensus" is a consensus on a LIMITED PROPOSITION, not
on your purported proof.
STOP USING MY NAME AND MY WORDS TO SUGGEST OTHERWISE.
Andr|- has identified a problem in your reasoning.
ANSWER HIM.
Repeating a proposition that other people agreed to is not an answer to
an objection about what you claim follows from it.
You write:
-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever someone
challenges YOUR conclusions.
And in this very message, you accuse Andr|- of:--
-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition.
You have been told this distinction over and over again.
You even acknowledge it, then immediately pretend it doesn't exist.
And this:
-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not establish your claimed semantic conclusion, the correctness of HHH's decision, or the satisfaction of Sipser's premise.
You have also quietly replaced Sipser's crucial requirement:
-a-a "H correctly determines"
with:
-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the inference establishing that HHH's decision is correct?
You cannot replace a proof obligation with a pair of square brackets.
And please spare me:
-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of comprehension.
Now, Peter, you have repeatedly and publicly presented yourself as a Christian.
Perhaps you should seriously reflect on what that entails for your own conduct.
Honesty matters. So does humility. So does representing other people's
words faithfully.
When someone explicitly tells you, repeatedly, that you are
misrepresenting their agreement, the appropriate response is to correct
your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding.
And certainly not to hide behind their names as supposed support for
your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what I have explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your responsibility too.
Perhaps it's time to apply some of those Christian principles you
profess to yourself, rather than lecturing everyone else about their supposed inability to understand you.
WHAT THE FUCK DOES THAT HAVE TO DO WITH WHAT I JUST TOLD YOU?
I accuse you of repeatedly misrepresenting the scope of other people's agreement.
And your answer is:
-a-a "You can look at the record on news.giganews.com
-a-a-a where my posts go back to 2004 and see that no
-a-a-a one from comp.theory has ever agreed with anything
-a-a-a like this until last Sunday."
SO WHAT?
Whether you waited twenty-two years, twenty-two minutes, or twenty-two centuries for someone to agree with that proposition is COMPLETELY IRRELEVANT.
You have obtained agreement on ONE LIMITED STATEMENT.--
Congratulations.
Nobody is trying to take that agreement away from you.
What we are challenging is what YOU CLAIM FOLLOWS FROM IT.
And THAT is precisely what you keep refusing to address.
Instead, you repeatedly invoke the names of people who agreed with the limited statement, as though their agreement somehow strengthened your subsequent conclusions.
It doesn't.
You have turned a mathematical discussion into a story about your
twenty-two years of struggle and your long-awaited recognition.
But mathematics does not work that way.
A proposition does not become more powerful because nobody agreed with
it for twenty-two years.
An invalid inference does not become valid because five people agree
with its premise.
And an objection to YOUR inference is not an objection to THEIR agreement.
Most importantly, you have STILL not answered my accusation:
WHY DO YOU KEEP INVOKING MY AGREEMENT TO SUPPORT CONCLUSIONS THAT I HAVE EXPLICITLY REJECTED?
Stop telling us how long you waited for agreement.
Stop telling us how many people agreed.
Stop telling us who helped formulate the statement.
NONE OF THAT PROVES YOUR NEXT STEP.
And none of it excuses your repeated misrepresentation of what other
people actually agreed to.
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever someone
challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition.
You have been told this distinction over and over again.
You even acknowledge it, then immediately pretend it doesn't exist.
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not establish
your claimed semantic conclusion, the correctness of HHH's decision,
or the satisfaction of Sipser's premise.
You have also quietly replaced Sipser's crucial requirement:
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the inference
establishing that HHH's decision is correct?
You cannot replace a proof obligation with a pair of square brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of comprehension.
Now, Peter, you have repeatedly and publicly presented yourself as a
Christian.
Perhaps you should seriously reflect on what that entails for your own
conduct.
Honesty matters. So does humility. So does representing other people's
words faithfully.
When someone explicitly tells you, repeatedly, that you are
misrepresenting their agreement, the appropriate response is to
correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding.
And certainly not to hide behind their names as supposed support for
your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what I have
explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your responsibility too.
Perhaps it's time to apply some of those Christian principles you
profess to yourself, rather than lecturing everyone else about their
supposed inability to understand you.
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever someone
challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
idk why u keep repeatedly confirming the halting theorum, HHH cannot accurately decide on DD Efn+
this doesn't stop EYon(DD) from being a halting machine or from HHH1 recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition.
You have been told this distinction over and over again.
You even acknowledge it, then immediately pretend it doesn't exist.
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not establish
your claimed semantic conclusion, the correctness of HHH's decision,
or the satisfaction of Sipser's premise.
You have also quietly replaced Sipser's crucial requirement:
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the inference
establishing that HHH's decision is correct?
You cannot replace a proof obligation with a pair of square brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of comprehension.
Now, Peter, you have repeatedly and publicly presented yourself as a
Christian.
Perhaps you should seriously reflect on what that entails for your
own conduct.
Honesty matters. So does humility. So does representing other
people's words faithfully.
When someone explicitly tells you, repeatedly, that you are
misrepresenting their agreement, the appropriate response is to
correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding.
And certainly not to hide behind their names as supposed support for
your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what I have
explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your responsibility too.
Perhaps it's time to apply some of those Christian principles you
profess to yourself, rather than lecturing everyone else about their
supposed inability to understand you.
On 11/3/2026 1:27 PM, Andr|- G. Isaak wrote:
On 2026-11-03 12:03, olcott wrote:
On 11/3/2026 12:20 PM, Andr|- G. Isaak wrote:
On 2026-11-03 09:47, olcott wrote:
On 11/3/2026 10:35 AM, Andr|- G. Isaak wrote:
On 2026-11-02 19:54, olcott wrote:
We already have a five-way consensus on the above words, quit cheating.<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>>> -a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a new
instance of HHH (call it HHH_1). HHH_1 then simulates a new
instance of DD_1, which in turn calls HHH_2 and so forth.
But that chain doesn't continue indefinitely.
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
Your simply repeating yourself without actually addressing my point. DD >>>
There appears to be a disconnect between what others have agreed to
and what you *think* they have agreed to. Python has pointed this out
to you numerous times.
On 11/2/2026 8:50 AM, Python wrote:
WHILE THE SIMULATION CONTINUES,
DD DOES NOT REACH ITS RETURN.
Pointing out a flaw in your reasoning hardly constitutes 'cheating'.
Maybe actually address the point.
Andr|-
There never has been a flaw in that reasoning.
dbush helped write the prior version.
On 2026-11-03 12:50, olcott wrote:
On 11/3/2026 1:27 PM, Andr|- G. Isaak wrote:
On 2026-11-03 12:03, olcott wrote:
On 11/3/2026 12:20 PM, Andr|- G. Isaak wrote:There appears to be a disconnect between what others have agreed to
On 2026-11-03 09:47, olcott wrote:
On 11/3/2026 10:35 AM, Andr|- G. Isaak wrote:
On 2026-11-02 19:54, olcott wrote:
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>>>> -a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a new >>>>>>> instance of HHH (call it HHH_1). HHH_1 then simulates a new
instance of DD_1, which in turn calls HHH_2 and so forth.
But that chain doesn't continue indefinitely.
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
Your simply repeating yourself without actually addressing my
point. DD
We already have a five-way consensus on the above words, quit cheating. >>>
and what you *think* they have agreed to. Python has pointed this out
to you numerous times.
On 11/2/2026 8:50 AM, Python wrote:
WHILE THE SIMULATION CONTINUES,
DD DOES NOT REACH ITS RETURN.
Yes. *While* the simulation continues, DD does not reach its return
instruction. That's because your HHH stops simulating (aborts) before DD reaches its return instruction; not because DD wouldn't ultimately reach
its return instruction had the simulation continued just a wee bit longer.
Pointing out a flaw in your reasoning hardly constitutes 'cheating'.
Maybe actually address the point.
Andr|-
There never has been a flaw in that reasoning.
dbush helped write the prior version.
Your HHH claims that DD, a halting program, doesn't halt. I'd call that
a major flaw in HHH's logic.
The problem is that you claim to have identified a 'non-halting pattern' where no such pattern exists.
You claim that when a function is called twice from the same address
with no intervening conditional statements, it constitutes a non halting pattern. But there *are* conditional statements intervening which your
HHH simply ignores. The HHH_1 which is invoked from within your DD, *conditionally* simulates DD_1. After each step in the simulation it
checks for your 'non-halting pattern' and only continues to simulate if
that pattern isn't met. Why does HHH not count those conditional
statements as conditional statements?
And Python has already called into question the accuracy of your alleged pattern but you've simply ignored him.
Andr|-
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever someone
challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
idk why u keep repeatedly confirming the halting theorum, HHH cannot
accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
this doesn't stop EYon(DD) from being a halting machine or from HHH1
recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition.
You have been told this distinction over and over again.
You even acknowledge it, then immediately pretend it doesn't exist.
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not establish
your claimed semantic conclusion, the correctness of HHH's decision,
or the satisfaction of Sipser's premise.
You have also quietly replaced Sipser's crucial requirement:
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the inference
establishing that HHH's decision is correct?
You cannot replace a proof obligation with a pair of square brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of comprehension.
Now, Peter, you have repeatedly and publicly presented yourself as a
Christian.
Perhaps you should seriously reflect on what that entails for your
own conduct.
Honesty matters. So does humility. So does representing other
people's words faithfully.
When someone explicitly tells you, repeatedly, that you are
misrepresenting their agreement, the appropriate response is to
correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding.
And certainly not to hide behind their names as supposed support for
your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what I have
explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your responsibility too.
Perhaps it's time to apply some of those Christian principles you
profess to yourself, rather than lecturing everyone else about their
supposed inability to understand you.
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever someone
challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
idk why u keep repeatedly confirming the halting theorum, HHH cannot
accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
HHH breaks the invariant that sipser pointed out and therefor
invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or from HHH1
recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition.
You have been told this distinction over and over again.
You even acknowledge it, then immediately pretend it doesn't exist.
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not establish
your claimed semantic conclusion, the correctness of HHH's
decision, or the satisfaction of Sipser's premise.
You have also quietly replaced Sipser's crucial requirement:
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the inference
establishing that HHH's decision is correct?
You cannot replace a proof obligation with a pair of square brackets. >>>>>
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of comprehension.
Now, Peter, you have repeatedly and publicly presented yourself as
a Christian.
Perhaps you should seriously reflect on what that entails for your
own conduct.
Honesty matters. So does humility. So does representing other
people's words faithfully.
When someone explicitly tells you, repeatedly, that you are
misrepresenting their agreement, the appropriate response is to
correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding.
And certainly not to hide behind their names as supposed support
for your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what I have >>>>> explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your responsibility too.
Perhaps it's time to apply some of those Christian principles you
profess to yourself, rather than lecturing everyone else about
their supposed inability to understand you.
On 11/3/2026 5:13 PM, Andr|- G. Isaak wrote:
On 2026-11-03 12:50, olcott wrote:
On 11/3/2026 1:27 PM, Andr|- G. Isaak wrote:
On 2026-11-03 12:03, olcott wrote:
On 11/3/2026 12:20 PM, Andr|- G. Isaak wrote:
On 2026-11-03 09:47, olcott wrote:
On 11/3/2026 10:35 AM, Andr|- G. Isaak wrote:
On 2026-11-02 19:54, olcott wrote:
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>> -a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a new >>>>>>>> instance of HHH (call it HHH_1). HHH_1 then simulates a new
instance of DD_1, which in turn calls HHH_2 and so forth.
But that chain doesn't continue indefinitely.
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
Your simply repeating yourself without actually addressing my
point. DD
We already have a five-way consensus on the above words, quit
cheating.
There appears to be a disconnect between what others have agreed to
and what you *think* they have agreed to. Python has pointed this
out to you numerous times.
On 11/2/2026 8:50 AM, Python wrote:
WHILE THE SIMULATION CONTINUES,
DD DOES NOT REACH ITS RETURN.
Yes. *While* the simulation continues, DD does not reach its return
This *is* the correct non-halting criteria that
specifies the halt property of the finite string
input.
What HHH does after this non-halt criteria has been
met has no effect on whether this non-halting criteria
has been met.
--instruction. That's because your HHH stops simulating (aborts) before
DD reaches its return instruction; not because DD wouldn't ultimately
reach its return instruction had the simulation continued just a wee
bit longer.
On 2026-11-03 16:19, olcott wrote:
On 11/3/2026 5:13 PM, Andr|- G. Isaak wrote:
On 2026-11-03 12:50, olcott wrote:
On 11/3/2026 1:27 PM, Andr|- G. Isaak wrote:
On 2026-11-03 12:03, olcott wrote:
On 11/3/2026 12:20 PM, Andr|- G. Isaak wrote:
On 2026-11-03 09:47, olcott wrote:
On 11/3/2026 10:35 AM, Andr|- G. Isaak wrote:
On 2026-11-02 19:54, olcott wrote:
<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>> 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>> -a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a >>>>>>>>> new instance of HHH (call it HHH_1). HHH_1 then simulates a new >>>>>>>>> instance of DD_1, which in turn calls HHH_2 and so forth.
But that chain doesn't continue indefinitely.
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
Your simply repeating yourself without actually addressing my
point. DD
We already have a five-way consensus on the above words, quit
cheating.
There appears to be a disconnect between what others have agreed to >>>>> and what you *think* they have agreed to. Python has pointed this
out to you numerous times.
On 11/2/2026 8:50 AM, Python wrote:
WHILE THE SIMULATION CONTINUES,
DD DOES NOT REACH ITS RETURN.
Yes. *While* the simulation continues, DD does not reach its return
This *is* the correct non-halting criteria that
specifies the halt property of the finite string
input.
If it gives the wrong answer it is decidedly *not* a correct criterion.
And it does give the wrong answer. I even pointed out the specific bug
in your code which leads it to that wrong answer.
And all your nonsense about 'finite sting inputs' is simply subterfuge. Finite strings are not halting or non-halting. The programs which they represent may be halting or non-halting. This is just your ludicrous
attempt to somehow claim that HHH simulates DD differently than when DD
is run directly, and yet is still somehow a correct simulation. This is prima facie absurd.
What HHH does after this non-halt criteria has been
met has no effect on whether this non-halting criteria
has been met.
What matters is what DD would have done if it's simulation had continued past the point when HHH decided to discontinue it.
Remember that if your example had actually followed Linz's proof, DDD wouldn't call HHH; it would contain it's own private copy of HHH (call
it HHH_1). If you had set things up this way you could easily verify my claims by simply removing the abort code from HHH while leaving the
abort code in HHH_1 intact. In such a case, your HHH would return
*halting* for DD, exactly as it should.
Andr|-
instruction. That's because your HHH stops simulating (aborts) before
DD reaches its return instruction; not because DD wouldn't ultimately
reach its return instruction had the simulation continued just a wee
bit longer.
YOU HAVE SOME FUCKING NERVE CALLING ANDR|e A LIAR.
Andr|- has just given you a SPECIFIC, TECHNICAL, TESTABLE objection to
your implementation.
He distinguishes:
-a-a HHH-a-a : the outer simulator
-a-a HHH_1 : the copy of HHH invoked by simulated DD--
He proposes removing the abort mechanism from the outer HHH while
retaining it in HHH_1, and predicts that the outer simulator will then observe DD halting.
That is a concrete technical claim. It can be examined, tested, and
either confirmed or refuted.
And your response?
-a-a "Are you a liar?"
-a-a "everyone persistently lied"
-a-a "I am going to assume that you are a liar unless
-a-a-a you prove otherwise in your next reply."
WHAT THE FUCK IS WRONG WITH YOUR APPROACH TO MATHEMATICAL DISCUSSION?
Someone identifies a potential bug in your code and explains how to
expose it.
You don't examine the proposed test.
You don't demonstrate why it would fail.
You don't identify a flaw in the reasoning.
Instead, you accuse him of dishonesty and repeat your precious "five-way consensus".
AGAIN.
Andr|- is NOT disputing that limited proposition.
He is disputing the correctness of the non-halting conclusion you claim
to derive from it.
YOU KNOW THE DIFFERENCE.
I have explained it to you repeatedly.
You have explicitly acknowledged it.
And yet you keep treating criticism of your inference as an attack on
the agreement itself.
That is not a misunderstanding anymore. It is a persistent
misrepresentation of the discussion.
And here is the particularly grotesque part:
You demand that Andr|- prove he is not a liar, while YOU repeatedly attribute to other people conclusions they have explicitly rejected.
You have been corrected about this, publicly, repeatedly, and in unmistakable language.
Perhaps you should examine your OWN conduct before accusing everyone
else of dishonesty.
You claim to have spent twenty-two years pursuing mathematical truth.
Then start behaving like someone interested in truth.
ANSWER ANDR|e'S TECHNICAL OBJECTION.
Explain why his proposed distinction between HHH and HHH_1 is invalid,
or why his predicted execution would not occur.
Show the code. Show the execution trace. Show the precise error, if
there is one.
And STOP hiding behind the names of people who agreed with a limited proposition.
Their agreement does not validate your detector.
Their agreement does not establish Sipser's premise.
Their agreement does not refute the Halting Theorem.
And their agreement certainly does not entitle you to call your critics liars.
At this point, Peter, the person whose intellectual honesty is most
urgently in need of examination is YOU.
Peter,
WHAT THE FUCK ARE YOU TALKING ABOUT?
Andr|-'s objection is precisely about DISTINGUISHING two execution instances.
-a-a HHH-a-a : the outer simulator--
-a-a HHH_1 : the instance invoked by simulated DD
NOBODY IS CLAIMING THEY ARE THE SAME EXECUTION INSTANCE.
THAT IS THE FUCKING POINT.
Andr|- proposes a concrete experiment involving these two distinct instances.
You respond with:
-a-a 2 + 3 = 2 + 3
-a-a 2 + 3 = 5
and a lecture about identity versus equivalence.
HOW DOES ANY OF THAT ANSWER HIS OBJECTION?
It doesn't.
Two syntactically different expressions can have the same value. Two executions of the same code can have different states and different outcomes.
But none of that establishes that your non-halting detector is correct.
You have simply changed the subject AGAIN.
And you have STILL not answered the actual question:
If the outer HHH continues simulating while the nested HHH_1 retains its abort mechanism, what exactly happens?
Does simulated DD eventually return?
If not, identify the precise execution step that prevents it.
If yes, explain why your original outer HHH reported non-halting.
THAT IS THE TEST.
Not whether 2 + 3 is syntactically identical to 5.
Not whether two processes are "one-and-the-same exact same thing."
Not whether your critics have been lying for twenty-two years.
THE FUCKING EXECUTION TRACE.
You have spent years demanding that everybody pay attention to every
subtle detail of your implementation.
Well, here is your opportunity.
SHOW US THE DETAILS.
Or admit that you have no technical answer to Andr|-'s objection.
On 11/3/2026 6:22 PM, Andr|- G. Isaak wrote:
On 2026-11-03 16:19, olcott wrote:
On 11/3/2026 5:13 PM, Andr|- G. Isaak wrote:
On 2026-11-03 12:50, olcott wrote:
On 11/3/2026 1:27 PM, Andr|- G. Isaak wrote:
On 2026-11-03 12:03, olcott wrote:
On 11/3/2026 12:20 PM, Andr|- G. Isaak wrote:
On 2026-11-03 09:47, olcott wrote:
On 11/3/2026 10:35 AM, Andr|- G. Isaak wrote:
On 2026-11-02 19:54, olcott wrote:
<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>> 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>>> -a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a >>>>>>>>>> new instance of HHH (call it HHH_1). HHH_1 then simulates a >>>>>>>>>> new instance of DD_1, which in turn calls HHH_2 and so forth. >>>>>>>>>>
But that chain doesn't continue indefinitely.
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches >>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>> steps.
Your simply repeating yourself without actually addressing my >>>>>>>> point. DD
We already have a five-way consensus on the above words, quit
cheating.
There appears to be a disconnect between what others have agreed
to and what you *think* they have agreed to. Python has pointed
this out to you numerous times.
On 11/2/2026 8:50 AM, Python wrote:
WHILE THE SIMULATION CONTINUES,
DD DOES NOT REACH ITS RETURN.
Yes. *While* the simulation continues, DD does not reach its return
This *is* the correct non-halting criteria that
specifies the halt property of the finite string
input.
If it gives the wrong answer it is decidedly *not* a correct criterion.
You dishonestly change the question. Are you a liar?
five-way consensus that took five years because
everyone persistently lied:
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
I am going to assume that you are a liar unless you
prove otherwise in your next reply.
And it does give the wrong answer. I even pointed out the specific bug
in your code which leads it to that wrong answer.
And all your nonsense about 'finite sting inputs' is simply
subterfuge. Finite strings are not halting or non-halting. The
programs which they represent may be halting or non-halting. This is
just your ludicrous attempt to somehow claim that HHH simulates DD
differently than when DD is run directly, and yet is still somehow a
correct simulation. This is prima facie absurd.
What HHH does after this non-halt criteria has been
met has no effect on whether this non-halting criteria
has been met.
What matters is what DD would have done if it's simulation had
continued past the point when HHH decided to discontinue it.
Remember that if your example had actually followed Linz's proof, DDD
wouldn't call HHH; it would contain it's own private copy of HHH (call
it HHH_1). If you had set things up this way you could easily verify
my claims by simply removing the abort code from HHH while leaving the
abort code in HHH_1 intact. In such a case, your HHH would return
*halting* for DD, exactly as it should.
Andr|-
instruction. That's because your HHH stops simulating (aborts)
before DD reaches its return instruction; not because DD wouldn't
ultimately reach its return instruction had the simulation continued
just a wee bit longer.
On 2026-11-03 12:50, olcott wrote:
On 11/3/2026 1:27 PM, Andr|- G. Isaak wrote:
On 2026-11-03 12:03, olcott wrote:
On 11/3/2026 12:20 PM, Andr|- G. Isaak wrote:There appears to be a disconnect between what others have agreed to
On 2026-11-03 09:47, olcott wrote:
On 11/3/2026 10:35 AM, Andr|- G. Isaak wrote:
On 2026-11-02 19:54, olcott wrote:
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>>>> -a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a new >>>>>>> instance of HHH (call it HHH_1). HHH_1 then simulates a new
instance of DD_1, which in turn calls HHH_2 and so forth.
But that chain doesn't continue indefinitely.
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
Your simply repeating yourself without actually addressing my
point. DD
We already have a five-way consensus on the above words, quit cheating. >>>
and what you *think* they have agreed to. Python has pointed this out
to you numerous times.
On 11/2/2026 8:50 AM, Python wrote:
WHILE THE SIMULATION CONTINUES,
DD DOES NOT REACH ITS RETURN.
Yes. *While* the simulation continues, DD does not reach its return instruction.
That's because your HHH stops simulating (aborts) before DD
reaches its return instruction;
On 11/3/2026 6:52 PM, Python wrote:
Peter,
WHAT THE FUCK ARE YOU TALKING ABOUT?
Andr|-'s objection is precisely about DISTINGUISHING two execution
instances.
That was always the mistake of how the foundations
of computation has been applied to the halting theorem.
There is only one of those two that meets this requirement.
Computation defined
Paraphrase of Emil Post definition of computation
All computations are equivalent applying finite string
transformation rules to finite string inputs to derive
any and all outputs.
Because Post canonical systems are Turing-equivalent,
anything that cannot be derived by applying finite string
transformations to finite strings is outside of the domain of
ChurchrCoTuring computable functions.
-a-a-a HHH-a-a : the outer simulator
-a-a-a HHH_1 : the instance invoked by simulated DD
NOBODY IS CLAIMING THEY ARE THE SAME EXECUTION INSTANCE.
THAT IS THE FUCKING POINT.
Andr|- proposes a concrete experiment involving these two distinct
instances.
You respond with:
-a-a-a 2 + 3 = 2 + 3
-a-a-a 2 + 3 = 5
and a lecture about identity versus equivalence.
HOW DOES ANY OF THAT ANSWER HIS OBJECTION?
It doesn't.
Two syntactically different expressions can have the same value. Two
executions of the same code can have different states and different
outcomes.
But none of that establishes that your non-halting detector is correct.
You have simply changed the subject AGAIN.
And you have STILL not answered the actual question:
If the outer HHH continues simulating while the nested HHH_1 retains
its abort mechanism, what exactly happens?
Does simulated DD eventually return?
If not, identify the precise execution step that prevents it.
If yes, explain why your original outer HHH reported non-halting.
THAT IS THE TEST.
Not whether 2 + 3 is syntactically identical to 5.
Not whether two processes are "one-and-the-same exact same thing."
Not whether your critics have been lying for twenty-two years.
THE FUCKING EXECUTION TRACE.
You have spent years demanding that everybody pay attention to every
subtle detail of your implementation.
Well, here is your opportunity.
SHOW US THE DETAILS.
Or admit that you have no technical answer to Andr|-'s objection.
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever someone
challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
idk why u keep repeatedly confirming the halting theorum, HHH cannot
accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
HHH breaks the invariant that sipser pointed out and therefor
invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or from HHH1
recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition.
You have been told this distinction over and over again.
You even acknowledge it, then immediately pretend it doesn't exist. >>>>>>
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not establish >>>>>> your claimed semantic conclusion, the correctness of HHH's
decision, or the satisfaction of Sipser's premise.
You have also quietly replaced Sipser's crucial requirement:
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the inference >>>>>> establishing that HHH's decision is correct?
You cannot replace a proof obligation with a pair of square brackets. >>>>>>
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of comprehension.
Now, Peter, you have repeatedly and publicly presented yourself as >>>>>> a Christian.
Perhaps you should seriously reflect on what that entails for your >>>>>> own conduct.
Honesty matters. So does humility. So does representing other
people's words faithfully.
When someone explicitly tells you, repeatedly, that you are
misrepresenting their agreement, the appropriate response is to
correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding.
And certainly not to hide behind their names as supposed support
for your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what I
have explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your responsibility too. >>>>>>
Perhaps it's time to apply some of those Christian principles you >>>>>> profess to yourself, rather than lecturing everyone else about
their supposed inability to understand you.
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever someone >>>>>>> challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
idk why u keep repeatedly confirming the halting theorum, HHH
cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles with the rest
of them. they don't even think something is broken, i do
i'm just trying to get u focused in the right direction.
failing to
acknowledge the invariant ur proof breaks ain't the right direction polcott
HHH breaks the invariant that sipser pointed out and therefor
invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or from HHH1 >>>>> recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition.
You have been told this distinction over and over again.
You even acknowledge it, then immediately pretend it doesn't exist. >>>>>>>
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not
establish your claimed semantic conclusion, the correctness of
HHH's decision, or the satisfaction of Sipser's premise.
You have also quietly replaced Sipser's crucial requirement:
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the inference >>>>>>> establishing that HHH's decision is correct?
You cannot replace a proof obligation with a pair of square
brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of comprehension. >>>>>>>
Now, Peter, you have repeatedly and publicly presented yourself >>>>>>> as a Christian.
Perhaps you should seriously reflect on what that entails for
your own conduct.
Honesty matters. So does humility. So does representing other
people's words faithfully.
When someone explicitly tells you, repeatedly, that you are
misrepresenting their agreement, the appropriate response is to >>>>>>> correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding.
And certainly not to hide behind their names as supposed support >>>>>>> for your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what I
have explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your responsibility too. >>>>>>>
Perhaps it's time to apply some of those Christian principles you >>>>>>> profess to yourself, rather than lecturing everyone else about
their supposed inability to understand you.
Someone identifies a potential bug in your code and explains how toThat is the neat part of discussion! If somebody took the time to find a
expose it.
WHAT THE FUCK DOES THAT HAVE TO DO WITH WHAT I JUST TOLD YOU?
I accuse you of repeatedly misrepresenting the scope of other people's agreement.
And your answer is:
-a-a "You can look at the record on news.giganews.com
-a-a-a where my posts go back to 2004 and see that no
-a-a-a one from comp.theory has ever agreed with anything
-a-a-a like this until last Sunday."
SO WHAT?
Whether you waited twenty-two years, twenty-two minutes, or twenty-two centuries for someone to agree with that proposition is COMPLETELY IRRELEVANT.
You have obtained agreement on ONE LIMITED STATEMENT.
Congratulations.
Nobody is trying to take that agreement away from you.
What we are challenging is what YOU CLAIM FOLLOWS FROM IT.
And THAT is precisely what you keep refusing to address.
Instead, you repeatedly invoke the names of people who agreed with the limited statement, as though their agreement somehow strengthened your subsequent conclusions.
It doesn't.
You have turned a mathematical discussion into a story about your
twenty-two years of struggle and your long-awaited recognition.
But mathematics does not work that way.
A proposition does not become more powerful because nobody agreed with
it for twenty-two years.
An invalid inference does not become valid because five people agree
with its premise.
And an objection to YOUR inference is not an objection to THEIR agreement.
Most importantly, you have STILL not answered my accusation:
WHY DO YOU KEEP INVOKING MY AGREEMENT TO SUPPORT CONCLUSIONS THAT I HAVE EXPLICITLY REJECTED?
Stop telling us how long you waited for agreement.
Stop telling us how many people agreed.
Stop telling us who helped formulate the statement.
NONE OF THAT PROVES YOUR NEXT STEP.
And none of it excuses your repeated misrepresentation of what other
people actually agreed to.
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever someone >>>>>>>> challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
idk why u keep repeatedly confirming the halting theorum, HHH
cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles with the
rest of them. they don't even think something is broken, i do
i'm just trying to get u focused in the right direction.
Your assumption that I am incorrect prevents
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't the right
direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final state.**
HHH breaks the invariant that sipser pointed out and therefor
invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or from HHH1 >>>>>> recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition. >>>>>>>>
You have been told this distinction over and over again.
You even acknowledge it, then immediately pretend it doesn't exist. >>>>>>>>
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not
establish your claimed semantic conclusion, the correctness of >>>>>>>> HHH's decision, or the satisfaction of Sipser's premise.
You have also quietly replaced Sipser's crucial requirement:
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the
inference establishing that HHH's decision is correct?
You cannot replace a proof obligation with a pair of square
brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of comprehension. >>>>>>>>
Now, Peter, you have repeatedly and publicly presented yourself >>>>>>>> as a Christian.
Perhaps you should seriously reflect on what that entails for >>>>>>>> your own conduct.
Honesty matters. So does humility. So does representing other >>>>>>>> people's words faithfully.
When someone explicitly tells you, repeatedly, that you are
misrepresenting their agreement, the appropriate response is to >>>>>>>> correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding.
And certainly not to hide behind their names as supposed support >>>>>>>> for your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what I >>>>>>>> have explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your responsibility too. >>>>>>>>
Perhaps it's time to apply some of those Christian principles >>>>>>>> you profess to yourself, rather than lecturing everyone else
about their supposed inability to understand you.
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever
someone challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
idk why u keep repeatedly confirming the halting theorum, HHH
cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles with the
rest of them. they don't even think something is broken, i do
i'm just trying to get u focused in the right direction.
Your assumption that I am incorrect prevents
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't the right
direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final state.**
which doesn't prove anything about the nature of DD. HHH causes the end
of DD's simulation, breaking the invariant that HHH not do that, as acknowledged by sipser as well
what does invariant mean to you polcott?
HHH breaks the invariant that sipser pointed out and therefor
invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or from HHH1 >>>>>>> recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition. >>>>>>>>>
You have been told this distinction over and over again.
You even acknowledge it, then immediately pretend it doesn't >>>>>>>>> exist.
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not
establish your claimed semantic conclusion, the correctness of >>>>>>>>> HHH's decision, or the satisfaction of Sipser's premise.
You have also quietly replaced Sipser's crucial requirement: >>>>>>>>>
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the
inference establishing that HHH's decision is correct?
You cannot replace a proof obligation with a pair of square >>>>>>>>> brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of comprehension. >>>>>>>>>
Now, Peter, you have repeatedly and publicly presented yourself >>>>>>>>> as a Christian.
Perhaps you should seriously reflect on what that entails for >>>>>>>>> your own conduct.
Honesty matters. So does humility. So does representing other >>>>>>>>> people's words faithfully.
When someone explicitly tells you, repeatedly, that you are >>>>>>>>> misrepresenting their agreement, the appropriate response is to >>>>>>>>> correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding. >>>>>>>>> And certainly not to hide behind their names as supposed
support for your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what I >>>>>>>>> have explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your responsibility too. >>>>>>>>>
Perhaps it's time to apply some of those Christian principles >>>>>>>>> you profess to yourself, rather than lecturing everyone else >>>>>>>>> about their supposed inability to understand you.
On 11/3/2026 10:49 PM, dart200 wrote:
[...]
Afaict, PO does not give a shit about your help!
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever someone >>>>>>>> challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
idk why u keep repeatedly confirming the halting theorum, HHH
cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles with the
rest of them. they don't even think something is broken, i do
i'm just trying to get u focused in the right direction.
Your assumption that I am incorrect prevents
you from understanding what I am saying.
--- Synchronet 3.22a-Linux NewsLink 1.2failing to acknowledge the invariant ur proof breaks ain't the right
direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final state.**
HHH breaks the invariant that sipser pointed out and therefor
invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or from HHH1 >>>>>> recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition. >>>>>>>>
You have been told this distinction over and over again.
You even acknowledge it, then immediately pretend it doesn't exist. >>>>>>>>
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not
establish your claimed semantic conclusion, the correctness of >>>>>>>> HHH's decision, or the satisfaction of Sipser's premise.
You have also quietly replaced Sipser's crucial requirement:
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the
inference establishing that HHH's decision is correct?
You cannot replace a proof obligation with a pair of square
brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of comprehension. >>>>>>>>
Now, Peter, you have repeatedly and publicly presented yourself >>>>>>>> as a Christian.
Perhaps you should seriously reflect on what that entails for >>>>>>>> your own conduct.
Honesty matters. So does humility. So does representing other >>>>>>>> people's words faithfully.
When someone explicitly tells you, repeatedly, that you are
misrepresenting their agreement, the appropriate response is to >>>>>>>> correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding.
And certainly not to hide behind their names as supposed support >>>>>>>> for your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what I >>>>>>>> have explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your responsibility too. >>>>>>>>
Perhaps it's time to apply some of those Christian principles >>>>>>>> you profess to yourself, rather than lecturing everyone else
about their supposed inability to understand you.
On 11/4/2026 3:32 AM, Chris M. Thomasson wrote:
On 11/3/2026 10:49 PM, dart200 wrote:
[...]
Afaict, PO does not give a shit about your help!
For God's sake, can you people get a grip!
This is supposed too be a threaded message board.
This is when you realize it's a circus and these are your chimps!
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever someone >>>>>>> challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
idk why u keep repeatedly confirming the halting theorum, HHH
cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles with the rest
of them. they don't even think something is broken, i do
i'm just trying to get u focused in the right direction. failing to acknowledge the invariant ur proof breaks ain't the right direction polcott
HHH breaks the invariant that sipser pointed out and therefor
invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or from HHH1 >>>>> recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition.
You have been told this distinction over and over again.
You even acknowledge it, then immediately pretend it doesn't exist. >>>>>>>
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not
establish your claimed semantic conclusion, the correctness of
HHH's decision, or the satisfaction of Sipser's premise.
You have also quietly replaced Sipser's crucial requirement:
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the inference >>>>>>> establishing that HHH's decision is correct?
You cannot replace a proof obligation with a pair of square
brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of comprehension. >>>>>>>
Now, Peter, you have repeatedly and publicly presented yourself >>>>>>> as a Christian.
Perhaps you should seriously reflect on what that entails for
your own conduct.
Honesty matters. So does humility. So does representing other
people's words faithfully.
When someone explicitly tells you, repeatedly, that you are
misrepresenting their agreement, the appropriate response is to >>>>>>> correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding.
And certainly not to hide behind their names as supposed support >>>>>>> for your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what I
have explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your responsibility too. >>>>>>>
Perhaps it's time to apply some of those Christian principles you >>>>>>> profess to yourself, rather than lecturing everyone else about
their supposed inability to understand you.
On 11/4/2026 9:46 AM, Dude wrote:
On 11/4/2026 3:32 AM, Chris M. Thomasson wrote:
On 11/3/2026 10:49 PM, dart200 wrote:For God's sake, can you people get a grip!
[...]
Afaict, PO does not give a shit about your help!
This is supposed too be a threaded message board.
This is when you realize it's a circus and these are your chimps!
I don't think PO understands the help he is getting.
On 11/4/2026 11:03 AM, Chris M. Thomasson wrote:
On 11/4/2026 9:46 AM, Dude wrote:
On 11/4/2026 3:32 AM, Chris M. Thomasson wrote:
On 11/3/2026 10:49 PM, dart200 wrote:For God's sake, can you people get a grip!
[...]
Afaict, PO does not give a shit about your help!
This is supposed too be a threaded message board.
This is when you realize it's a circus and these are your chimps!
I don't think PO understands the help he is getting.
It may be a cry for help, but it also could be that some people just
feel better when they have someone to talk to. YMMV.
On 11/2/26 9:26 PM, olcott wrote:
On 11/2/2026 11:08 PM, dart200 wrote:
On 11/2/26 5:17 PM, olcott wrote:
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:quoting sipser is not a proof polcott:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring >>>>>>>>>>>>>>>>>>> some uniquely profound understanding of the >>>>>>>>>>>>>>>>>>> "foundations of computation".
You cannot correctly leap to that conclusion. >>>>>>>>>>>>>>>>>> Hypothesize this and I will prove it later: >>>>>>>>>>>>>>>>>>
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts >>>>>>>>>>>>>>>>>
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the >>>>>>>>>>>>>>> halting semantics of DD when simulated by universal >>>>>>>>>>>>>>> simulator (EYon as defined by turing), which is the halting >>>>>>>>>>>>>>> semantics we are interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its >>>>>>>>>>>>>> simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>>
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted >>>>>>>>>>>>
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>> 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which >>>>>>>> the conclusion rests upon a statement made by some presumed
authority or witness... Because the testimony of a qualified
authority or witness provides a reason for believing a claim, >>>>>>>> such arguments are often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D >>>>>>> would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>>> -a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
sipser himself only agreed that H is correct *unless DD is aborted then* >>>
ur actively ignoring the conditional on the proof, which is that H is
correct if and only if D is then not aborted...
HHH aborts DD's simulation, so therefore the analysis HHH makes prior
to the abort is invalidated
ur can write me off a useless troll all u want, but i'm still going
to try to post helpful comments polcott. and i suggest that ignoring
the conditional is a major flaw in what ur trying to propose atm
Why the fuck do you add those two groups
cause i'm hoping u'll actually take this seriously instead of running
away again tbh???
alt.buddha.short.fat.guy''
tbh i kinda hate the dud cons that infest that group. i'm tryin to make
them less stupid but ya know how trump loving types go eh??? walk around with their head up their asshole most of the day denying basic physical facts to confirm their endlessly narcissistic biases...
alt.messianic
just using it as a personal journal i guess??? Efn+Efn+Efn+
Have you always only been a troll?
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever
someone challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches >>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>> steps.
idk why u keep repeatedly confirming the halting theorum, HHH >>>>>>>> cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles with the
rest of them. they don't even think something is broken, i do
i'm just trying to get u focused in the right direction.
Your assumption that I am incorrect prevents
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't the right
direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final state.**
which doesn't prove anything about the nature of DD. HHH causes the
end of DD's simulation, breaking the invariant that HHH not do that,
as acknowledged by sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens after
simulation has been aborted or we would judge that all infinite
loops always halt. Instead we look for a repeating state while the
simulation continues.
HHH breaks the invariant that sipser pointed out and therefor
invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or from >>>>>>>> HHH1 recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition. >>>>>>>>>>
You have been told this distinction over and over again.
You even acknowledge it, then immediately pretend it doesn't >>>>>>>>>> exist.
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not
establish your claimed semantic conclusion, the correctness of >>>>>>>>>> HHH's decision, or the satisfaction of Sipser's premise.
You have also quietly replaced Sipser's crucial requirement: >>>>>>>>>>
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the
inference establishing that HHH's decision is correct?
You cannot replace a proof obligation with a pair of square >>>>>>>>>> brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of comprehension. >>>>>>>>>>
Now, Peter, you have repeatedly and publicly presented
yourself as a Christian.
Perhaps you should seriously reflect on what that entails for >>>>>>>>>> your own conduct.
Honesty matters. So does humility. So does representing other >>>>>>>>>> people's words faithfully.
When someone explicitly tells you, repeatedly, that you are >>>>>>>>>> misrepresenting their agreement, the appropriate response is >>>>>>>>>> to correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding. >>>>>>>>>> And certainly not to hide behind their names as supposed
support for your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what I >>>>>>>>>> have explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your responsibility >>>>>>>>>> too.
Perhaps it's time to apply some of those Christian principles >>>>>>>>>> you profess to yourself, rather than lecturing everyone else >>>>>>>>>> about their supposed inability to understand you.
On 11/2/2026 5:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring some >>>>>>>>>>>>>>>> uniquely profound understanding of the "foundations of >>>>>>>>>>>>>>>> computation".
You cannot correctly leap to that conclusion.
Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon as >>>>>>>>>>>> defined by turing), which is the halting semantics we are >>>>>>>>>>>> interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>>> -a-a-a-a would never stop running unless aborted then
quoting sipser is not a proof polcott:
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the
conclusion rests upon a statement made by some presumed authority
or witness... Because the testimony of a qualified authority or
witness provides a reason for believing a claim, such arguments are >>>>> often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D
would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
the "then" refers to aborting after the recursion is detected. sipser
provides an exception to the correctness of the decision, explicitly
if the simulation is _then_ aborted after the determination is made.
this is what HHH does, and therefore the analysis by HHH of DD is
invalidated
it sucks to be wrong polcott, but it's better to admit ur wrong than
continue being wrong, this is know from experience
Sage advice.
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever >>>>>>>>>>> someone challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches >>>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>>> steps.
idk why u keep repeatedly confirming the halting theorum, HHH >>>>>>>>> cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles with the
rest of them. they don't even think something is broken, i do
i'm just trying to get u focused in the right direction.
Your assumption that I am incorrect prevents
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't the
right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final state.**
which doesn't prove anything about the nature of DD. HHH causes the
end of DD's simulation, breaking the invariant that HHH not do that,
as acknowledged by sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens after
simulation has been aborted or we would judge that all infinite
loops always halt. Instead we look for a repeating state while the
simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an
overgeneralization fallacy polcott. not only does HHH need to prove that
the recursion happens, HHH needs to prove that it continues to happen.
one can't just prove the base case in an inductive proof, one needs to
prove it for N+1 based on the premise of it for N
HHH only proves that one recursive call happens, no where does it prove
that the N+1 case happens.
and really not only does HHH not prove that
the recursion continues, HHH actually intervenes with that recursion
from happening
HHH breaks the invariant that sipser pointed out and therefor
invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or from >>>>>>>>> HHH1 recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition. >>>>>>>>>>>
You have been told this distinction over and over again. >>>>>>>>>>>
You even acknowledge it, then immediately pretend it doesn't >>>>>>>>>>> exist.
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not >>>>>>>>>>> establish your claimed semantic conclusion, the correctness >>>>>>>>>>> of HHH's decision, or the satisfaction of Sipser's premise. >>>>>>>>>>>
You have also quietly replaced Sipser's crucial requirement: >>>>>>>>>>>
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the >>>>>>>>>>> inference establishing that HHH's decision is correct?
You cannot replace a proof obligation with a pair of square >>>>>>>>>>> brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of
comprehension.
Now, Peter, you have repeatedly and publicly presented
yourself as a Christian.
Perhaps you should seriously reflect on what that entails for >>>>>>>>>>> your own conduct.
Honesty matters. So does humility. So does representing other >>>>>>>>>>> people's words faithfully.
When someone explicitly tells you, repeatedly, that you are >>>>>>>>>>> misrepresenting their agreement, the appropriate response is >>>>>>>>>>> to correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding. >>>>>>>>>>> And certainly not to hide behind their names as supposed >>>>>>>>>>> support for your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what >>>>>>>>>>> I have explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your responsibility >>>>>>>>>>> too.
Perhaps it's time to apply some of those Christian principles >>>>>>>>>>> you profess to yourself, rather than lecturing everyone else >>>>>>>>>>> about their supposed inability to understand you.
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:which doesn't prove anything about the nature of DD. HHH causes the
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever >>>>>>>>>>>> someone challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH >>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>> semantics of C such that the simulated C function DD reaches >>>>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>>>> steps.
idk why u keep repeatedly confirming the halting theorum, HHH >>>>>>>>>> cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles with the >>>>>> rest of them. they don't even think something is broken, i do
i'm just trying to get u focused in the right direction.
Your assumption that I am incorrect prevents
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't the
right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final state.** >>>>
end of DD's simulation, breaking the invariant that HHH not do that,
as acknowledged by sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens after
simulation has been aborted or we would judge that all infinite
loops always halt. Instead we look for a repeating state while the
simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an
overgeneralization fallacy polcott. not only does HHH need to prove
that the recursion happens, HHH needs to prove that it continues to
happen. one can't just prove the base case in an inductive proof, one
needs to prove it for N+1 based on the premise of it for N
I can't help it that this is over you head.
HHH only proves that one recursive call happens, no where does it
prove that the N+1 case happens.
Counter-factual
-aand really not only does HHH not prove that the recursion continues,
HHH actually intervenes with that recursion from happening
Proving that YOU WILL NOT PAY ATTENTION
HHH breaks the invariant that sipser pointed out and therefor >>>>>>>> invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or from >>>>>>>>>> HHH1 recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition. >>>>>>>>>>>>
You have been told this distinction over and over again. >>>>>>>>>>>>
You even acknowledge it, then immediately pretend it doesn't >>>>>>>>>>>> exist.
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not >>>>>>>>>>>> establish your claimed semantic conclusion, the correctness >>>>>>>>>>>> of HHH's decision, or the satisfaction of Sipser's premise. >>>>>>>>>>>>
You have also quietly replaced Sipser's crucial requirement: >>>>>>>>>>>>
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the >>>>>>>>>>>> inference establishing that HHH's decision is correct? >>>>>>>>>>>>
You cannot replace a proof obligation with a pair of square >>>>>>>>>>>> brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of
comprehension.
Now, Peter, you have repeatedly and publicly presented >>>>>>>>>>>> yourself as a Christian.
Perhaps you should seriously reflect on what that entails >>>>>>>>>>>> for your own conduct.
Honesty matters. So does humility. So does representing >>>>>>>>>>>> other people's words faithfully.
When someone explicitly tells you, repeatedly, that you are >>>>>>>>>>>> misrepresenting their agreement, the appropriate response is >>>>>>>>>>>> to correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding. >>>>>>>>>>>> And certainly not to hide behind their names as supposed >>>>>>>>>>>> support for your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes what >>>>>>>>>>>> I have explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your
responsibility too.
Perhaps it's time to apply some of those Christian
principles you profess to yourself, rather than lecturing >>>>>>>>>>>> everyone else about their supposed inability to understand you. >>>>>>>>>>>
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:which doesn't prove anything about the nature of DD. HHH causes the >>>>> end of DD's simulation, breaking the invariant that HHH not do
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever >>>>>>>>>>>>> someone challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH >>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>> semantics of C such that the simulated C function DD reaches >>>>>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>>>>> steps.
idk why u keep repeatedly confirming the halting theorum, HHH >>>>>>>>>>> cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles with
the rest of them. they don't even think something is broken, i do >>>>>>>
i'm just trying to get u focused in the right direction.
Your assumption that I am incorrect prevents
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't the
right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final state.** >>>>>
that, as acknowledged by sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens after
simulation has been aborted or we would judge that all infinite
loops always halt. Instead we look for a repeating state while the
simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an
overgeneralization fallacy polcott. not only does HHH need to prove
that the recursion happens, HHH needs to prove that it continues to
happen. one can't just prove the base case in an inductive proof, one
needs to prove it for N+1 based on the premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head
HHH only proves that one recursive call happens, no where does it
prove that the N+1 case happens.
Counter-factual
what does counter-factual mean to you polcott?
-aand really not only does HHH not prove that the recursion continues,
HHH actually intervenes with that recursion from happening
Proving that YOU WILL NOT PAY ATTENTION
ur willfully ignoring that i am paying attention
HHH breaks the invariant that sipser pointed out and therefor >>>>>>>>> invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or from >>>>>>>>>>> HHH1 recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition. >>>>>>>>>>>>>
You have been told this distinction over and over again. >>>>>>>>>>>>>
You even acknowledge it, then immediately pretend it >>>>>>>>>>>>> doesn't exist.
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not >>>>>>>>>>>>> establish your claimed semantic conclusion, the correctness >>>>>>>>>>>>> of HHH's decision, or the satisfaction of Sipser's premise. >>>>>>>>>>>>>
You have also quietly replaced Sipser's crucial requirement: >>>>>>>>>>>>>
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the >>>>>>>>>>>>> inference establishing that HHH's decision is correct? >>>>>>>>>>>>>
You cannot replace a proof obligation with a pair of square >>>>>>>>>>>>> brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of
comprehension.
Now, Peter, you have repeatedly and publicly presented >>>>>>>>>>>>> yourself as a Christian.
Perhaps you should seriously reflect on what that entails >>>>>>>>>>>>> for your own conduct.
Honesty matters. So does humility. So does representing >>>>>>>>>>>>> other people's words faithfully.
When someone explicitly tells you, repeatedly, that you are >>>>>>>>>>>>> misrepresenting their agreement, the appropriate response >>>>>>>>>>>>> is to correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding. >>>>>>>>>>>>> And certainly not to hide behind their names as supposed >>>>>>>>>>>>> support for your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes >>>>>>>>>>>>> what I have explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your
responsibility too.
Perhaps it's time to apply some of those Christian
principles you profess to yourself, rather than lecturing >>>>>>>>>>>>> everyone else about their supposed inability to understand >>>>>>>>>>>>> you.
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:which doesn't prove anything about the nature of DD. HHH causes the >>>>> end of DD's simulation, breaking the invariant that HHH not do
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever >>>>>>>>>>>>> someone challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr
like this until last Sunday:
There does not exist any implementation of C function HHH >>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>> semantics of C such that the simulated C function DD reaches >>>>>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>>>>> steps.
idk why u keep repeatedly confirming the halting theorum, HHH >>>>>>>>>>> cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles with
the rest of them. they don't even think something is broken, i do >>>>>>>
i'm just trying to get u focused in the right direction.
Your assumption that I am incorrect prevents
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't the
right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final state.** >>>>>
that, as acknowledged by sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens after
simulation has been aborted or we would judge that all infinite
loops always halt. Instead we look for a repeating state while the
simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an
overgeneralization fallacy polcott. not only does HHH need to prove
that the recursion happens, HHH needs to prove that it continues to
happen. one can't just prove the base case in an inductive proof, one
needs to prove it for N+1 based on the premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head
HHH only proves that one recursive call happens, no where does it
prove that the N+1 case happens.
Counter-factual
what does counter-factual mean to you polcott?
-aand really not only does HHH not prove that the recursion continues,
HHH actually intervenes with that recursion from happening
Proving that YOU WILL NOT PAY ATTENTION
ur willfully ignoring that i am paying attention
HHH breaks the invariant that sipser pointed out and therefor >>>>>>>>> invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or from >>>>>>>>>>> HHH1 recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed proposition. >>>>>>>>>>>>>
You have been told this distinction over and over again. >>>>>>>>>>>>>
You even acknowledge it, then immediately pretend it >>>>>>>>>>>>> doesn't exist.
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not >>>>>>>>>>>>> establish your claimed semantic conclusion, the correctness >>>>>>>>>>>>> of HHH's decision, or the satisfaction of Sipser's premise. >>>>>>>>>>>>>
You have also quietly replaced Sipser's crucial requirement: >>>>>>>>>>>>>
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the >>>>>>>>>>>>> inference establishing that HHH's decision is correct? >>>>>>>>>>>>>
You cannot replace a proof obligation with a pair of square >>>>>>>>>>>>> brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK."
I understand perfectly well what you CLAIM follows.
I dispute that it follows.
That is a mathematical objection, not a failure of
comprehension.
Now, Peter, you have repeatedly and publicly presented >>>>>>>>>>>>> yourself as a Christian.
Perhaps you should seriously reflect on what that entails >>>>>>>>>>>>> for your own conduct.
Honesty matters. So does humility. So does representing >>>>>>>>>>>>> other people's words faithfully.
When someone explicitly tells you, repeatedly, that you are >>>>>>>>>>>>> misrepresenting their agreement, the appropriate response >>>>>>>>>>>>> is to correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding. >>>>>>>>>>>>> And certainly not to hide behind their names as supposed >>>>>>>>>>>>> support for your conclusions.
You are free to believe that your proof is correct.
You are NOT free to claim that my agreement establishes >>>>>>>>>>>>> what I have explicitly and repeatedly denied.
Your mathematical argument is your responsibility.
Your treatment of other people's words is your
responsibility too.
Perhaps it's time to apply some of those Christian
principles you profess to yourself, rather than lecturing >>>>>>>>>>>>> everyone else about their supposed inability to understand >>>>>>>>>>>>> you.
On 11/4/2026 12:28 PM, Dude wrote:
On 11/4/2026 11:03 AM, Chris M. Thomasson wrote:
On 11/4/2026 9:46 AM, Dude wrote:It may be a cry for help, but it also could be that some people just
On 11/4/2026 3:32 AM, Chris M. Thomasson wrote:
On 11/3/2026 10:49 PM, dart200 wrote:For God's sake, can you people get a grip!
[...]
Afaict, PO does not give a shit about your help!
This is supposed too be a threaded message board.
This is when you realize it's a circus and these are your chimps!
I don't think PO understands the help he is getting.
feel better when they have someone to talk to. YMMV.
Touche.
On 11/3/2026 12:29 AM, dart200 wrote:
On 11/2/26 9:26 PM, olcott wrote:
On 11/2/2026 11:08 PM, dart200 wrote:
On 11/2/26 5:17 PM, olcott wrote:
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:quoting sipser is not a proof polcott:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring >>>>>>>>>>>>>>>>>>>> some uniquely profound understanding of the >>>>>>>>>>>>>>>>>>>> "foundations of computation".
You cannot correctly leap to that conclusion. >>>>>>>>>>>>>>>>>>> Hypothesize this and I will prove it later: >>>>>>>>>>>>>>>>>>>
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts >>>>>>>>>>>>>>>>>>
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input. >>>>>>>>>>>>>>>>>
DD simulated by HHH never halts.
There exists no alternatives to DD simulated >>>>>>>>>>>>>>>>> by HHH to determine the behavior specified by >>>>>>>>>>>>>>>>> the input DD. Try and think of one.
right, in no universe can HHH correctly decide the >>>>>>>>>>>>>>>> halting semantics of DD when simulated by universal >>>>>>>>>>>>>>>> simulator (EYon as defined by turing), which is the halting >>>>>>>>>>>>>>>> semantics we are interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its >>>>>>>>>>>>>>> simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>>>
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted >>>>>>>>>>>>>
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>> 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which >>>>>>>>> the conclusion rests upon a statement made by some presumed >>>>>>>>> authority or witness... Because the testimony of a qualified >>>>>>>>> authority or witness provides a reason for believing a claim, >>>>>>>>> such arguments are often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated >>>>>>>> D would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D >>>>>>> -a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
sipser himself only agreed that H is correct *unless DD is aborted
then*
ur actively ignoring the conditional on the proof, which is that H
is correct if and only if D is then not aborted...
HHH aborts DD's simulation, so therefore the analysis HHH makes
prior to the abort is invalidated
ur can write me off a useless troll all u want, but i'm still going
to try to post helpful comments polcott. and i suggest that ignoring
the conditional is a major flaw in what ur trying to propose atm
Why the fuck do you add those two groups
cause i'm hoping u'll actually take this seriously instead of running
away again tbh???
alt.buddha.short.fat.guy''
tbh i kinda hate the dud cons that infest that group. i'm tryin to
make them less stupid but ya know how trump loving types go eh??? walk
around with their head up their asshole most of the day denying basic
physical facts to confirm their endlessly narcissistic biases...
alt.messianic
just using it as a personal journal i guess??? Efn+Efn+Efn+
Have you always only been a troll?
You are smarter than him. Deal with it... ;^D
On 11/4/2026 1:40 PM, Chris M. Thomasson wrote:
On 11/3/2026 12:29 AM, dart200 wrote:
On 11/2/26 9:26 PM, olcott wrote:
On 11/2/2026 11:08 PM, dart200 wrote:
On 11/2/26 5:17 PM, olcott wrote:
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:The ONLY point that I am making is the above point.
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:quoting sipser is not a proof polcott:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim >>>>>>>>>>>>>>>> words 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring >>>>>>>>>>>>>>>>>>>>> some uniquely profound understanding of the >>>>>>>>>>>>>>>>>>>>> "foundations of computation".
You cannot correctly leap to that conclusion. >>>>>>>>>>>>>>>>>>>> Hypothesize this and I will prove it later: >>>>>>>>>>>>>>>>>>>>
DD simulated by HHH is the only correct way to >>>>>>>>>>>>>>>>>>>> determine
the semantic halting property of the input finite >>>>>>>>>>>>>>>>>>>> string
of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here >>>>>>>>>>>>>>>>>>> }-a-a-a-a-a-a-a-a-a-a-a -a // main also halts >>>>>>>>>>>>>>>>>>>
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input. >>>>>>>>>>>>>>>>>>
DD simulated by HHH never halts.
There exists no alternatives to DD simulated >>>>>>>>>>>>>>>>>> by HHH to determine the behavior specified by >>>>>>>>>>>>>>>>>> the input DD. Try and think of one.
right, in no universe can HHH correctly decide the >>>>>>>>>>>>>>>>> halting semantics of DD when simulated by universal >>>>>>>>>>>>>>>>> simulator (EYon as defined by turing), which is the >>>>>>>>>>>>>>>>> halting semantics we are interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its >>>>>>>>>>>>>>>> simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>>>>
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted >>>>>>>>>>>>>>
right, but DD running forever is only a hypothetical. >>>>>>>>>>>>
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>> 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is? >>>>>>>>>>>
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which >>>>>>>>>> the conclusion rests upon a statement made by some presumed >>>>>>>>>> authority or witness... Because the testimony of a qualified >>>>>>>>>> authority or witness provides a reason for believing a claim, >>>>>>>>>> such arguments are often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated >>>>>>>>> D would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D >>>>>>>> -a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
sipser himself only agreed that H is correct *unless DD is aborted
then*
ur actively ignoring the conditional on the proof, which is that H
is correct if and only if D is then not aborted...
HHH aborts DD's simulation, so therefore the analysis HHH makes
prior to the abort is invalidated
ur can write me off a useless troll all u want, but i'm still going >>>>> to try to post helpful comments polcott. and i suggest that
ignoring the conditional is a major flaw in what ur trying to
propose atm
Why the fuck do you add those two groups
cause i'm hoping u'll actually take this seriously instead of running
away again tbh???
alt.buddha.short.fat.guy''
tbh i kinda hate the dud cons that infest that group. i'm tryin to
make them less stupid but ya know how trump loving types go eh???
walk around with their head up their asshole most of the day denying
basic physical facts to confirm their endlessly narcissistic biases...
alt.messianic
just using it as a personal journal i guess??? Efn+Efn+Efn+
Have you always only been a troll?
You are smarter than him. Deal with it... ;^D
It looks like an appeal to authority fallacy - Alan Turing.
An appeal to authority fallacy (known formally as argumentum ad
verecundiam) occurs when someone claims that something must be true
simply because an authority figure, expert, or celebrity said sorCowithout offering actual evidence or logical proof.
Where's Creon?
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise."
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever >>>>>>>>>>>>>> someone challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr >>>>>>>>>>>>> like this until last Sunday:
There does not exist any implementation of C function HHH >>>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>>> semantics of C such that the simulated C function DD reaches >>>>>>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>>>>>> steps.
idk why u keep repeatedly confirming the halting theorum, >>>>>>>>>>>> HHH cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles with >>>>>>>> the rest of them. they don't even think something is broken, i do >>>>>>>>
i'm just trying to get u focused in the right direction.
Your assumption that I am incorrect prevents
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't the >>>>>>>> right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final
state.**
which doesn't prove anything about the nature of DD. HHH causes
the end of DD's simulation, breaking the invariant that HHH not do >>>>>> that, as acknowledged by sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens after
simulation has been aborted or we would judge that all infinite
loops always halt. Instead we look for a repeating state while the
simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an
overgeneralization fallacy polcott. not only does HHH need to prove
that the recursion happens, HHH needs to prove that it continues to
happen. one can't just prove the base case in an inductive proof,
one needs to prove it for N+1 based on the premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head
*This is what induction proves*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
HHH only proves that one recursive call happens, no where does it
prove that the N+1 case happens.
Counter-factual
what does counter-factual mean to you polcott?
-aand really not only does HHH not prove that the recursion
continues, HHH actually intervenes with that recursion from happening
Proving that YOU WILL NOT PAY ATTENTION
ur willfully ignoring that i am paying attention
HHH breaks the invariant that sipser pointed out and therefor >>>>>>>>>> invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or from >>>>>>>>>>>> HHH1 recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed >>>>>>>>>>>>>> proposition.
You have been told this distinction over and over again. >>>>>>>>>>>>>>
You even acknowledge it, then immediately pretend it >>>>>>>>>>>>>> doesn't exist.
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not >>>>>>>>>>>>>> establish your claimed semantic conclusion, the
correctness of HHH's decision, or the satisfaction of >>>>>>>>>>>>>> Sipser's premise.
You have also quietly replaced Sipser's crucial requirement: >>>>>>>>>>>>>>
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the >>>>>>>>>>>>>> inference establishing that HHH's decision is correct? >>>>>>>>>>>>>>
You cannot replace a proof obligation with a pair of >>>>>>>>>>>>>> square brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK." >>>>>>>>>>>>>>
I understand perfectly well what you CLAIM follows. >>>>>>>>>>>>>>
I dispute that it follows.
That is a mathematical objection, not a failure of >>>>>>>>>>>>>> comprehension.
Now, Peter, you have repeatedly and publicly presented >>>>>>>>>>>>>> yourself as a Christian.
Perhaps you should seriously reflect on what that entails >>>>>>>>>>>>>> for your own conduct.
Honesty matters. So does humility. So does representing >>>>>>>>>>>>>> other people's words faithfully.
When someone explicitly tells you, repeatedly, that you >>>>>>>>>>>>>> are misrepresenting their agreement, the appropriate >>>>>>>>>>>>>> response is to correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of understanding. >>>>>>>>>>>>>> And certainly not to hide behind their names as supposed >>>>>>>>>>>>>> support for your conclusions.
You are free to believe that your proof is correct. >>>>>>>>>>>>>>
You are NOT free to claim that my agreement establishes >>>>>>>>>>>>>> what I have explicitly and repeatedly denied.
Your mathematical argument is your responsibility. >>>>>>>>>>>>>>
Your treatment of other people's words is your
responsibility too.
Perhaps it's time to apply some of those Christian >>>>>>>>>>>>>> principles you profess to yourself, rather than lecturing >>>>>>>>>>>>>> everyone else about their supposed inability to understand >>>>>>>>>>>>>> you.
On 11/5/2026 11:01 AM, Dude wrote:
On 11/4/2026 1:40 PM, Chris M. Thomasson wrote:
On 11/3/2026 12:29 AM, dart200 wrote:It looks like an appeal to authority fallacy - Alan Turing.
On 11/2/26 9:26 PM, olcott wrote:
On 11/2/2026 11:08 PM, dart200 wrote:
On 11/2/26 5:17 PM, olcott wrote:
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:The ONLY point that I am making is the above point.
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:quoting sipser is not a proof polcott:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim >>>>>>>>>>>>>>>>> words 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote: >>>>>>>>>>>>>>>>>>>>>> Oh, come on, Peter.
There is nothing remotely mysterious here >>>>>>>>>>>>>>>>>>>>>> requiring some uniquely profound understanding of >>>>>>>>>>>>>>>>>>>>>> the "foundations of computation".
You cannot correctly leap to that conclusion. >>>>>>>>>>>>>>>>>>>>> Hypothesize this and I will prove it later: >>>>>>>>>>>>>>>>>>>>>
DD simulated by HHH is the only correct way to >>>>>>>>>>>>>>>>>>>>> determine
the semantic halting property of the input finite >>>>>>>>>>>>>>>>>>>>> string
of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here >>>>>>>>>>>>>>>>>>>> }-a-a-a-a-a-a-a-a-a-a-a -a // main also halts >>>>>>>>>>>>>>>>>>>>
If you would pay 100% complete attention >>>>>>>>>>>>>>>>>>> you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to >>>>>>>>>>>>>>>>>>> report on whatever sequence of steps is
directly encoded in the finite string input. >>>>>>>>>>>>>>>>>>>
DD simulated by HHH never halts.
There exists no alternatives to DD simulated >>>>>>>>>>>>>>>>>>> by HHH to determine the behavior specified by >>>>>>>>>>>>>>>>>>> the input DD. Try and think of one.
right, in no universe can HHH correctly decide the >>>>>>>>>>>>>>>>>> halting semantics of DD when simulated by universal >>>>>>>>>>>>>>>>>> simulator (EYon as defined by turing), which is the >>>>>>>>>>>>>>>>>> halting semantics we are interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its >>>>>>>>>>>>>>>>> simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>>>>>
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted >>>>>>>>>>>>>>>
right, but DD running forever is only a hypothetical. >>>>>>>>>>>>>
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>>> 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>>
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is? >>>>>>>>>>>>
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which >>>>>>>>>>> the conclusion rests upon a statement made by some presumed >>>>>>>>>>> authority or witness... Because the testimony of a qualified >>>>>>>>>>> authority or witness provides a reason for believing a claim, >>>>>>>>>>> such arguments are often inductively strong or cogent."
key line from sipser: H correctly determines that its
simulated D would never stop running _unless aborted then_ >>>>>>>>>>
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D >>>>>>>>> -a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
sipser himself only agreed that H is correct *unless DD is aborted >>>>>> then*
ur actively ignoring the conditional on the proof, which is that H >>>>>> is correct if and only if D is then not aborted...
HHH aborts DD's simulation, so therefore the analysis HHH makes
prior to the abort is invalidated
ur can write me off a useless troll all u want, but i'm still
going to try to post helpful comments polcott. and i suggest that >>>>>> ignoring the conditional is a major flaw in what ur trying to
propose atm
Why the fuck do you add those two groups
cause i'm hoping u'll actually take this seriously instead of
running away again tbh???
alt.buddha.short.fat.guy''
tbh i kinda hate the dud cons that infest that group. i'm tryin to
make them less stupid but ya know how trump loving types go eh???
walk around with their head up their asshole most of the day denying
basic physical facts to confirm their endlessly narcissistic biases... >>>>
alt.messianic
just using it as a personal journal i guess??? Efn+Efn+Efn+
Have you always only been a troll?
You are smarter than him. Deal with it... ;^D
An appeal to authority fallacy (known formally as argumentum ad
verecundiam) occurs when someone claims that something must be true
simply because an authority figure, expert, or celebrity said sorCo
without offering actual evidence or logical proof.
Where's Creon?
On the other hand an appeal to a qualified expert in the field
is inductively strong.
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever >>>>>>>>>>>>>>> someone challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr >>>>>>>>>>>>>> like this until last Sunday:
There does not exist any implementation of C function HHH >>>>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>>>> semantics of C such that the simulated C function DD reaches >>>>>>>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>>>>>>> steps.
idk why u keep repeatedly confirming the halting theorum, >>>>>>>>>>>>> HHH cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles with >>>>>>>>> the rest of them. they don't even think something is broken, i do >>>>>>>>>
i'm just trying to get u focused in the right direction.
Your assumption that I am incorrect prevents
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't the >>>>>>>>> right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final
state.**
which doesn't prove anything about the nature of DD. HHH causes >>>>>>> the end of DD's simulation, breaking the invariant that HHH not >>>>>>> do that, as acknowledged by sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens after
simulation has been aborted or we would judge that all infinite
loops always halt. Instead we look for a repeating state while the >>>>>> simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an
overgeneralization fallacy polcott. not only does HHH need to prove >>>>> that the recursion happens, HHH needs to prove that it continues to >>>>> happen. one can't just prove the base case in an inductive proof,
one needs to prove it for N+1 based on the premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head
*This is what induction proves*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
and this doesn't prove that DD is a non-terminating machine. i can't
believe we're still arguing about this
HHH only proves that one recursive call happens, no where does it
prove that the N+1 case happens.
Counter-factual
what does counter-factual mean to you polcott?
-aand really not only does HHH not prove that the recursionProving that YOU WILL NOT PAY ATTENTION
continues, HHH actually intervenes with that recursion from happening >>>>
ur willfully ignoring that i am paying attention
HHH breaks the invariant that sipser pointed out and therefor >>>>>>>>>>> invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or >>>>>>>>>>>>> from HHH1 recognizing DD correctly
And in this very message, you accuse Andr|- of:
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed >>>>>>>>>>>>>>> proposition.
You have been told this distinction over and over again. >>>>>>>>>>>>>>>
You even acknowledge it, then immediately pretend it >>>>>>>>>>>>>>> doesn't exist.
And this:
-a-a-a "Your own words prove that this is true"
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not >>>>>>>>>>>>>>> establish your claimed semantic conclusion, the >>>>>>>>>>>>>>> correctness of HHH's decision, or the satisfaction of >>>>>>>>>>>>>>> Sipser's premise.
You have also quietly replaced Sipser's crucial requirement: >>>>>>>>>>>>>>>
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the >>>>>>>>>>>>>>> inference establishing that HHH's decision is correct? >>>>>>>>>>>>>>>
You cannot replace a proof obligation with a pair of >>>>>>>>>>>>>>> square brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK." >>>>>>>>>>>>>>>
I understand perfectly well what you CLAIM follows. >>>>>>>>>>>>>>>
I dispute that it follows.
That is a mathematical objection, not a failure of >>>>>>>>>>>>>>> comprehension.
Now, Peter, you have repeatedly and publicly presented >>>>>>>>>>>>>>> yourself as a Christian.
Perhaps you should seriously reflect on what that entails >>>>>>>>>>>>>>> for your own conduct.
Honesty matters. So does humility. So does representing >>>>>>>>>>>>>>> other people's words faithfully.
When someone explicitly tells you, repeatedly, that you >>>>>>>>>>>>>>> are misrepresenting their agreement, the appropriate >>>>>>>>>>>>>>> response is to correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of
understanding.
And certainly not to hide behind their names as supposed >>>>>>>>>>>>>>> support for your conclusions.
You are free to believe that your proof is correct. >>>>>>>>>>>>>>>
You are NOT free to claim that my agreement establishes >>>>>>>>>>>>>>> what I have explicitly and repeatedly denied.
Your mathematical argument is your responsibility. >>>>>>>>>>>>>>>
Your treatment of other people's words is your
responsibility too.
Perhaps it's time to apply some of those Christian >>>>>>>>>>>>>>> principles you profess to yourself, rather than lecturing >>>>>>>>>>>>>>> everyone else about their supposed inability to >>>>>>>>>>>>>>> understand you.
On 2026-11-03 12:50, olcott wrote:
On 11/3/2026 1:27 PM, Andr|- G. Isaak wrote:
On 2026-11-03 12:03, olcott wrote:
On 11/3/2026 12:20 PM, Andr|- G. Isaak wrote:There appears to be a disconnect between what others have agreed to
On 2026-11-03 09:47, olcott wrote:
On 11/3/2026 10:35 AM, Andr|- G. Isaak wrote:
On 2026-11-02 19:54, olcott wrote:
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>>>> -a-a-a-a would never stop running unless aborted then
Since we can see that the Professor Sipser approved
criteria has been met then it is reasonably plausible
(actually dead certain yet over everyone's head)
that HHH can see this too. When HHH does see this
then the the above "if" has been fully satisfied.
But the "Sipser approved criterion' hasn't been met.
You have your HHH simulating DD. Simulated DD then invokes a new >>>>>>> instance of HHH (call it HHH_1). HHH_1 then simulates a new
instance of DD_1, which in turn calls HHH_2 and so forth.
But that chain doesn't continue indefinitely.
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
Your simply repeating yourself without actually addressing my
point. DD
We already have a five-way consensus on the above words, quit cheating. >>>
and what you *think* they have agreed to. Python has pointed this out
to you numerous times.
On 11/2/2026 8:50 AM, Python wrote:
WHILE THE SIMULATION CONTINUES,
DD DOES NOT REACH ITS RETURN.
Yes. *While* the simulation continues, DD does not reach its return instruction. That's because your HHH stops simulating (aborts) before DD reaches its return instruction;
not because DD wouldn't ultimately reach
its return instruction had the simulation continued just a wee bit longer.
Pointing out a flaw in your reasoning hardly constitutes 'cheating'.
Maybe actually address the point.
Andr|-
There never has been a flaw in that reasoning.
dbush helped write the prior version.
Your HHH claims that DD, a halting program, doesn't halt. I'd call that
a major flaw in HHH's logic.
The problem is that you claim to have identified a 'non-halting pattern' where no such pattern exists.
You claim that when a function is called twice from the same address
with no intervening conditional statements, it constitutes a non halting pattern. But there *are* conditional statements intervening which your
HHH simply ignores. The HHH_1 which is invoked from within your DD, *conditionally* simulates DD_1. After each step in the simulation it
checks for your 'non-halting pattern' and only continues to simulate if
that pattern isn't met. Why does HHH not count those conditional
statements as conditional statements?
And Python has already called into question the accuracy of your alleged pattern but you've simply ignored him.
Andr|-
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way consensus" whenever >>>>>>>>>>>>>>>> someone challenges YOUR conclusions.
You can look at the record on news.giganews.com
where my posts go back to 2004 and see that no
one from comp.theory has every agreed with anythingr >>>>>>>>>>>>>>> like this until last Sunday:
There does not exist any implementation of C function HHH >>>>>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>>>>> semantics of C such that the simulated C function DD reaches >>>>>>>>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>>>>>>>> steps.
idk why u keep repeatedly confirming the halting theorum, >>>>>>>>>>>>>> HHH cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles with >>>>>>>>>> the rest of them. they don't even think something is broken, i do >>>>>>>>>>
i'm just trying to get u focused in the right direction.
Your assumption that I am incorrect prevents
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't the >>>>>>>>>> right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final >>>>>>>>> state.**
which doesn't prove anything about the nature of DD. HHH causes >>>>>>>> the end of DD's simulation, breaking the invariant that HHH not >>>>>>>> do that, as acknowledged by sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens after
simulation has been aborted or we would judge that all infinite
loops always halt. Instead we look for a repeating state while the >>>>>>> simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an
overgeneralization fallacy polcott. not only does HHH need to
prove that the recursion happens, HHH needs to prove that it
continues to happen. one can't just prove the base case in an
inductive proof, one needs to prove it for N+1 based on the
premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head
*This is what induction proves*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
and this doesn't prove that DD is a non-terminating machine. i can't
believe we're still arguing about this
If a computable function cannot be reduced to applying
finite string transformations to its finite string inputs
then the computation of this function is outside of the
scope of Turing computable functions in the same way
that filling your tires with air is outside the scope
of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
HHH only proves that one recursive call happens, no where does it >>>>>> prove that the N+1 case happens.
Counter-factual
what does counter-factual mean to you polcott?
-aand really not only does HHH not prove that the recursionProving that YOU WILL NOT PAY ATTENTION
continues, HHH actually intervenes with that recursion from happening >>>>>
ur willfully ignoring that i am paying attention
HHH breaks the invariant that sipser pointed out and
therefor invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or >>>>>>>>>>>>>> from HHH1 recognizing DD correctly
And in this very message, you accuse Andr|- of: >>>>>>>>>>>>>>>>
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed >>>>>>>>>>>>>>>> proposition.
You have been told this distinction over and over again. >>>>>>>>>>>>>>>>
You even acknowledge it, then immediately pretend it >>>>>>>>>>>>>>>> doesn't exist.
And this:
-a-a-a "Your own words prove that this is true" >>>>>>>>>>>>>>>>
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do not >>>>>>>>>>>>>>>> establish your claimed semantic conclusion, the >>>>>>>>>>>>>>>> correctness of HHH's decision, or the satisfaction of >>>>>>>>>>>>>>>> Sipser's premise.
You have also quietly replaced Sipser's crucial >>>>>>>>>>>>>>>> requirement:
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the >>>>>>>>>>>>>>>> inference establishing that HHH's decision is correct? >>>>>>>>>>>>>>>>
You cannot replace a proof obligation with a pair of >>>>>>>>>>>>>>>> square brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK." >>>>>>>>>>>>>>>>
I understand perfectly well what you CLAIM follows. >>>>>>>>>>>>>>>>
I dispute that it follows.
That is a mathematical objection, not a failure of >>>>>>>>>>>>>>>> comprehension.
Now, Peter, you have repeatedly and publicly presented >>>>>>>>>>>>>>>> yourself as a Christian.
Perhaps you should seriously reflect on what that >>>>>>>>>>>>>>>> entails for your own conduct.
Honesty matters. So does humility. So does representing >>>>>>>>>>>>>>>> other people's words faithfully.
When someone explicitly tells you, repeatedly, that you >>>>>>>>>>>>>>>> are misrepresenting their agreement, the appropriate >>>>>>>>>>>>>>>> response is to correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of >>>>>>>>>>>>>>>> understanding.
And certainly not to hide behind their names as supposed >>>>>>>>>>>>>>>> support for your conclusions.
You are free to believe that your proof is correct. >>>>>>>>>>>>>>>>
You are NOT free to claim that my agreement establishes >>>>>>>>>>>>>>>> what I have explicitly and repeatedly denied.
Your mathematical argument is your responsibility. >>>>>>>>>>>>>>>>
Your treatment of other people's words is your >>>>>>>>>>>>>>>> responsibility too.
Perhaps it's time to apply some of those Christian >>>>>>>>>>>>>>>> principles you profess to yourself, rather than >>>>>>>>>>>>>>>> lecturing everyone else about their supposed inability >>>>>>>>>>>>>>>> to understand you.
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:Your assumption that I am incorrect prevents
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way consensus" >>>>>>>>>>>>>>>>> whenever someone challenges YOUR conclusions. >>>>>>>>>>>>>>>>>
You can look at the record on news.giganews.com >>>>>>>>>>>>>>>> where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>> one from comp.theory has every agreed with anythingr >>>>>>>>>>>>>>>> like this until last Sunday:
There does not exist any implementation of C function HHH >>>>>>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>>>>>> semantics of C such that the simulated C function DD >>>>>>>>>>>>>>>> reaches
its own simulated return statement in any N finite >>>>>>>>>>>>>>>> number of
steps.
idk why u keep repeatedly confirming the halting theorum, >>>>>>>>>>>>>>> HHH cannot accurately decide on DD Efn+
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles >>>>>>>>>>> with the rest of them. they don't even think something is >>>>>>>>>>> broken, i do
i'm just trying to get u focused in the right direction. >>>>>>>>>>
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't >>>>>>>>>>> the right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final >>>>>>>>>> state.**
which doesn't prove anything about the nature of DD. HHH causes >>>>>>>>> the end of DD's simulation, breaking the invariant that HHH not >>>>>>>>> do that, as acknowledged by sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens after >>>>>>>> simulation has been aborted or we would judge that all infinite >>>>>>>> loops always halt. Instead we look for a repeating state while the >>>>>>>> simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an
overgeneralization fallacy polcott. not only does HHH need to
prove that the recursion happens, HHH needs to prove that it
continues to happen. one can't just prove the base case in an
inductive proof, one needs to prove it for N+1 based on the
premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head
*This is what induction proves*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
and this doesn't prove that DD is a non-terminating machine. i can't
believe we're still arguing about this
If a computable function cannot be reduced to applying
finite string transformations to its finite string inputs
then the computation of this function is outside of the
scope of Turing computable functions in the same way
that filling your tires with air is outside the scope
of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a total halting decider!
as such, it's expected that HHH will failed to correctly compute the
halting semantics of some input, of which DD is one example...
u seem to understand this, but i don't know what is so hard about
accepting it polcott
HHH only proves that one recursive call happens, no where does it >>>>>>> prove that the N+1 case happens.
Counter-factual
what does counter-factual mean to you polcott?
-aand really not only does HHH not prove that the recursion
continues, HHH actually intervenes with that recursion from
happening
Proving that YOU WILL NOT PAY ATTENTION
ur willfully ignoring that i am paying attention
HHH breaks the invariant that sipser pointed out and >>>>>>>>>>>>> therefor invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or >>>>>>>>>>>>>>> from HHH1 recognizing DD correctly
And in this very message, you accuse Andr|- of: >>>>>>>>>>>>>>>>>
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed >>>>>>>>>>>>>>>>> proposition.
You have been told this distinction over and over again. >>>>>>>>>>>>>>>>>
You even acknowledge it, then immediately pretend it >>>>>>>>>>>>>>>>> doesn't exist.
And this:
-a-a-a "Your own words prove that this is true" >>>>>>>>>>>>>>>>>
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do >>>>>>>>>>>>>>>>> not establish your claimed semantic conclusion, the >>>>>>>>>>>>>>>>> correctness of HHH's decision, or the satisfaction of >>>>>>>>>>>>>>>>> Sipser's premise.
You have also quietly replaced Sipser's crucial >>>>>>>>>>>>>>>>> requirement:
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is the >>>>>>>>>>>>>>>>> inference establishing that HHH's decision is correct? >>>>>>>>>>>>>>>>>
You cannot replace a proof obligation with a pair of >>>>>>>>>>>>>>>>> square brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK." >>>>>>>>>>>>>>>>>
I understand perfectly well what you CLAIM follows. >>>>>>>>>>>>>>>>>
I dispute that it follows.
That is a mathematical objection, not a failure of >>>>>>>>>>>>>>>>> comprehension.
Now, Peter, you have repeatedly and publicly presented >>>>>>>>>>>>>>>>> yourself as a Christian.
Perhaps you should seriously reflect on what that >>>>>>>>>>>>>>>>> entails for your own conduct.
Honesty matters. So does humility. So does representing >>>>>>>>>>>>>>>>> other people's words faithfully.
When someone explicitly tells you, repeatedly, that you >>>>>>>>>>>>>>>>> are misrepresenting their agreement, the appropriate >>>>>>>>>>>>>>>>> response is to correct your representation.
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of >>>>>>>>>>>>>>>>> understanding.
And certainly not to hide behind their names as >>>>>>>>>>>>>>>>> supposed support for your conclusions.
You are free to believe that your proof is correct. >>>>>>>>>>>>>>>>>
You are NOT free to claim that my agreement establishes >>>>>>>>>>>>>>>>> what I have explicitly and repeatedly denied. >>>>>>>>>>>>>>>>>
Your mathematical argument is your responsibility. >>>>>>>>>>>>>>>>>
Your treatment of other people's words is your >>>>>>>>>>>>>>>>> responsibility too.
Perhaps it's time to apply some of those Christian >>>>>>>>>>>>>>>>> principles you profess to yourself, rather than >>>>>>>>>>>>>>>>> lecturing everyone else about their supposed inability >>>>>>>>>>>>>>>>> to understand you.
On 11/5/2026 1:03 PM, dart200 wrote:
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:Your assumption that I am incorrect prevents
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way consensus" >>>>>>>>>>>>>>>>>> whenever someone challenges YOUR conclusions. >>>>>>>>>>>>>>>>>>
You can look at the record on news.giganews.com >>>>>>>>>>>>>>>>> where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>>> one from comp.theory has every agreed with anythingr >>>>>>>>>>>>>>>>> like this until last Sunday:
There does not exist any implementation of C function HHH >>>>>>>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>>>>>>> semantics of C such that the simulated C function DD >>>>>>>>>>>>>>>>> reaches
its own simulated return statement in any N finite >>>>>>>>>>>>>>>>> number of
steps.
idk why u keep repeatedly confirming the halting >>>>>>>>>>>>>>>> theorum, HHH cannot accurately decide on DD Efn+ >>>>>>>>>>>>>>>>
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles >>>>>>>>>>>> with the rest of them. they don't even think something is >>>>>>>>>>>> broken, i do
i'm just trying to get u focused in the right direction. >>>>>>>>>>>
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't >>>>>>>>>>>> the right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final >>>>>>>>>>> state.**
which doesn't prove anything about the nature of DD. HHH
causes the end of DD's simulation, breaking the invariant that >>>>>>>>>> HHH not do that, as acknowledged by sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens after >>>>>>>>> simulation has been aborted or we would judge that all infinite >>>>>>>>> loops always halt. Instead we look for a repeating state while the >>>>>>>>> simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an
overgeneralization fallacy polcott. not only does HHH need to >>>>>>>> prove that the recursion happens, HHH needs to prove that it
continues to happen. one can't just prove the base case in an >>>>>>>> inductive proof, one needs to prove it for N+1 based on the
premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head
*This is what induction proves*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
and this doesn't prove that DD is a non-terminating machine. i can't
believe we're still arguing about this
If a computable function cannot be reduced to applying
finite string transformations to its finite string inputs
then the computation of this function is outside of the
scope of Turing computable functions in the same way
that filling your tires with air is outside the scope
of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a total halting
decider!
As it turns out to actually be this is for the
same reason that your toaster cannot fill your
tires with air.
It has always been a stupid mistake to base the
limits of computation on what math wants instead
of what computation is and how computation works.
as such, it's expected that HHH will failed to correctly compute the
halting semantics of some input, of which DD is one example...
u seem to understand this, but i don't know what is so hard about
accepting it polcott
HHH only proves that one recursive call happens, no where does >>>>>>>> it prove that the N+1 case happens.
Counter-factual
what does counter-factual mean to you polcott?
-aand really not only does HHH not prove that the recursion
continues, HHH actually intervenes with that recursion from
happening
Proving that YOU WILL NOT PAY ATTENTION
ur willfully ignoring that i am paying attention
HHH breaks the invariant that sipser pointed out and >>>>>>>>>>>>>> therefor invalidates it's proof
u do know what an invariant is, correct?
this doesn't stop EYon(DD) from being a halting machine or >>>>>>>>>>>>>>>> from HHH1 recognizing DD correctly
And in this very message, you accuse Andr|- of: >>>>>>>>>>>>>>>>>>
-a-a-a "rebutting the five-way consensus"
HE IS NOT.
He is challenging YOUR INFERENCES from the agreed >>>>>>>>>>>>>>>>>> proposition.
You have been told this distinction over and over again. >>>>>>>>>>>>>>>>>>
You even acknowledge it, then immediately pretend it >>>>>>>>>>>>>>>>>> doesn't exist.
And this:
-a-a-a "Your own words prove that this is true" >>>>>>>>>>>>>>>>>>
NO, THEY FUCKING DON'T.
My words establish exactly what I agreed to. They do >>>>>>>>>>>>>>>>>> not establish your claimed semantic conclusion, the >>>>>>>>>>>>>>>>>> correctness of HHH's decision, or the satisfaction of >>>>>>>>>>>>>>>>>> Sipser's premise.
You have also quietly replaced Sipser's crucial >>>>>>>>>>>>>>>>>> requirement:
-a-a-a "H correctly determines"
with:
-a-a-a "[we can see]"
WHO can see? WHAT exactly has been proved? WHERE is >>>>>>>>>>>>>>>>>> the inference establishing that HHH's decision is >>>>>>>>>>>>>>>>>> correct?
You cannot replace a proof obligation with a pair of >>>>>>>>>>>>>>>>>> square brackets.
And please spare me:
-a-a-a "That you don't understand that yet is OK." >>>>>>>>>>>>>>>>>>
I understand perfectly well what you CLAIM follows. >>>>>>>>>>>>>>>>>>
I dispute that it follows.
That is a mathematical objection, not a failure of >>>>>>>>>>>>>>>>>> comprehension.
Now, Peter, you have repeatedly and publicly presented >>>>>>>>>>>>>>>>>> yourself as a Christian.
Perhaps you should seriously reflect on what that >>>>>>>>>>>>>>>>>> entails for your own conduct.
Honesty matters. So does humility. So does >>>>>>>>>>>>>>>>>> representing other people's words faithfully. >>>>>>>>>>>>>>>>>>
When someone explicitly tells you, repeatedly, that >>>>>>>>>>>>>>>>>> you are misrepresenting their agreement, the >>>>>>>>>>>>>>>>>> appropriate response is to correct your representation. >>>>>>>>>>>>>>>>>>
Not to keep doing it.
Not to accuse your critics of cheating.
Not to dismiss their objections as failures of >>>>>>>>>>>>>>>>>> understanding.
And certainly not to hide behind their names as >>>>>>>>>>>>>>>>>> supposed support for your conclusions.
You are free to believe that your proof is correct. >>>>>>>>>>>>>>>>>>
You are NOT free to claim that my agreement >>>>>>>>>>>>>>>>>> establishes what I have explicitly and repeatedly denied. >>>>>>>>>>>>>>>>>>
Your mathematical argument is your responsibility. >>>>>>>>>>>>>>>>>>
Your treatment of other people's words is your >>>>>>>>>>>>>>>>>> responsibility too.
Perhaps it's time to apply some of those Christian >>>>>>>>>>>>>>>>>> principles you profess to yourself, rather than >>>>>>>>>>>>>>>>>> lecturing everyone else about their supposed inability >>>>>>>>>>>>>>>>>> to understand you.
On 11/5/26 11:08 AM, olcott wrote:
On 11/5/2026 1:03 PM, dart200 wrote:
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:Your assumption that I am incorrect prevents
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way consensus" >>>>>>>>>>>>>>>>>>> whenever someone challenges YOUR conclusions. >>>>>>>>>>>>>>>>>>>
You can look at the record on news.giganews.com >>>>>>>>>>>>>>>>>> where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>>>> one from comp.theory has every agreed with anythingr >>>>>>>>>>>>>>>>>> like this until last Sunday:
There does not exist any implementation of C function HHH >>>>>>>>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>>>>>>>> semantics of C such that the simulated C function DD >>>>>>>>>>>>>>>>>> reaches
its own simulated return statement in any N finite >>>>>>>>>>>>>>>>>> number of
steps.
idk why u keep repeatedly confirming the halting >>>>>>>>>>>>>>>>> theorum, HHH cannot accurately decide on DD Efn+ >>>>>>>>>>>>>>>>>
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles >>>>>>>>>>>>> with the rest of them. they don't even think something is >>>>>>>>>>>>> broken, i do
i'm just trying to get u focused in the right direction. >>>>>>>>>>>>
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't >>>>>>>>>>>>> the right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated final >>>>>>>>>>>> state.**
which doesn't prove anything about the nature of DD. HHH >>>>>>>>>>> causes the end of DD's simulation, breaking the invariant >>>>>>>>>>> that HHH not do that, as acknowledged by sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens after >>>>>>>>>> simulation has been aborted or we would judge that all infinite >>>>>>>>>> loops always halt. Instead we look for a repeating state while >>>>>>>>>> the
simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an
overgeneralization fallacy polcott. not only does HHH need to >>>>>>>>> prove that the recursion happens, HHH needs to prove that it >>>>>>>>> continues to happen. one can't just prove the base case in an >>>>>>>>> inductive proof, one needs to prove it for N+1 based on the >>>>>>>>> premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head
*This is what induction proves*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
and this doesn't prove that DD is a non-terminating machine. i
can't believe we're still arguing about this
If a computable function cannot be reduced to applying
finite string transformations to its finite string inputs
then the computation of this function is outside of the
scope of Turing computable functions in the same way
that filling your tires with air is outside the scope
of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a total halting
decider!
As it turns out to actually be this is for the
same reason that your toaster cannot fill your
tires with air.
so ur not actually disagreeing with the halting theorem?
It has always been a stupid mistake to base the
limits of computation on what math wants instead
of what computation is and how computation works.
but the halting theorem is proven based on how computation works...
appealing to authority has zero weight in formal math dud
On 11/2/26 9:16 PM, Chris M. Thomasson wrote:
On 11/2/2026 5:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring >>>>>>>>>>>>>>>>> some uniquely profound understanding of the >>>>>>>>>>>>>>>>> "foundations of computation".
You cannot correctly leap to that conclusion.
Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon as >>>>>>>>>>>>> defined by turing), which is the halting semantics we are >>>>>>>>>>>>> interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>>>> -a-a-a-a would never stop running unless aborted then
quoting sipser is not a proof polcott:
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the >>>>>> conclusion rests upon a statement made by some presumed authority >>>>>> or witness... Because the testimony of a qualified authority or
witness provides a reason for believing a claim, such arguments
are often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D
would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
the "then" refers to aborting after the recursion is detected. sipser
provides an exception to the correctness of the decision, explicitly
if the simulation is _then_ aborted after the determination is made.
this is what HHH does, and therefore the analysis by HHH of DD is
invalidated
it sucks to be wrong polcott, but it's better to admit ur wrong than
continue being wrong, this is know from experience
Sage advice.
could u ever have foreseen sage advice coming from me chris?
On 11/5/26 9:05 AM, olcott wrote:
On 11/5/2026 11:01 AM, Dude wrote:
On 11/4/2026 1:40 PM, Chris M. Thomasson wrote:
On 11/3/2026 12:29 AM, dart200 wrote:It looks like an appeal to authority fallacy - Alan Turing.
On 11/2/26 9:26 PM, olcott wrote:
On 11/2/2026 11:08 PM, dart200 wrote:
On 11/2/26 5:17 PM, olcott wrote:
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:The ONLY point that I am making is the above point. >>>>>>>>>>>>>> Every other point is a mere distraction away from
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:quoting sipser is not a proof polcott:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim >>>>>>>>>>>>>>>>>> words 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>> On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote: >>>>>>>>>>>>>>>>>>>>>>> Oh, come on, Peter.
There is nothing remotely mysterious here >>>>>>>>>>>>>>>>>>>>>>> requiring some uniquely profound understanding of >>>>>>>>>>>>>>>>>>>>>>> the "foundations of computation". >>>>>>>>>>>>>>>>>>>>>>>
You cannot correctly leap to that conclusion. >>>>>>>>>>>>>>>>>>>>>> Hypothesize this and I will prove it later: >>>>>>>>>>>>>>>>>>>>>>
DD simulated by HHH is the only correct way to >>>>>>>>>>>>>>>>>>>>>> determine
the semantic halting property of the input finite >>>>>>>>>>>>>>>>>>>>>> string
of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here >>>>>>>>>>>>>>>>>>>>> }-a-a-a-a-a-a-a-a-a-a-a -a // main also halts >>>>>>>>>>>>>>>>>>>>>
If you would pay 100% complete attention >>>>>>>>>>>>>>>>>>>> you would see that computable functions >>>>>>>>>>>>>>>>>>>> are not allowed to do that.
Computable functions are only allowed to >>>>>>>>>>>>>>>>>>>> report on whatever sequence of steps is >>>>>>>>>>>>>>>>>>>> directly encoded in the finite string input. >>>>>>>>>>>>>>>>>>>>
DD simulated by HHH never halts.
There exists no alternatives to DD simulated >>>>>>>>>>>>>>>>>>>> by HHH to determine the behavior specified by >>>>>>>>>>>>>>>>>>>> the input DD. Try and think of one.
right, in no universe can HHH correctly decide the >>>>>>>>>>>>>>>>>>> halting semantics of DD when simulated by universal >>>>>>>>>>>>>>>>>>> simulator (EYon as defined by turing), which is the >>>>>>>>>>>>>>>>>>> halting semantics we are interested in:
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its >>>>>>>>>>>>>>>>>> simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>>>>>>
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted >>>>>>>>>>>>>>>>
right, but DD running forever is only a hypothetical. >>>>>>>>>>>>>>
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>>>> 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its >>>>>>>>>>>>>> simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>>>
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is? >>>>>>>>>>>>>
I know what that deductive fallacy is on the other hand >>>>>>>>>>>>
"An argument from authority is an inductive argument in >>>>>>>>>>>> which the conclusion rests upon a statement made by some >>>>>>>>>>>> presumed authority or witness... Because the testimony of a >>>>>>>>>>>> qualified authority or witness provides a reason for
believing a claim, such arguments are often inductively >>>>>>>>>>>> strong or cogent."
key line from sipser: H correctly determines that its
simulated D would never stop running _unless aborted then_ >>>>>>>>>>>
<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>> 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>> -a-a-a input D until H correctly determines that its simulated D >>>>>>>>>> -a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
sipser himself only agreed that H is correct *unless DD is
aborted then*
ur actively ignoring the conditional on the proof, which is that >>>>>>> H is correct if and only if D is then not aborted...
HHH aborts DD's simulation, so therefore the analysis HHH makes >>>>>>> prior to the abort is invalidated
ur can write me off a useless troll all u want, but i'm still
going to try to post helpful comments polcott. and i suggest that >>>>>>> ignoring the conditional is a major flaw in what ur trying to
propose atm
Why the fuck do you add those two groups
cause i'm hoping u'll actually take this seriously instead of
running away again tbh???
alt.buddha.short.fat.guy''
tbh i kinda hate the dud cons that infest that group. i'm tryin to
make them less stupid but ya know how trump loving types go eh???
walk around with their head up their asshole most of the day
denying basic physical facts to confirm their endlessly
narcissistic biases...
alt.messianic
just using it as a personal journal i guess??? Efn+Efn+Efn+
Have you always only been a troll?
You are smarter than him. Deal with it... ;^D
An appeal to authority fallacy (known formally as argumentum ad
verecundiam) occurs when someone claims that something must be true
simply because an authority figure, expert, or celebrity said sorCo
without offering actual evidence or logical proof.
Where's Creon?
On the other hand an appeal to a qualified expert in the field
is inductively strong.
appealing to authority has zero weight in formal math dud
On 11/5/2026 9:08 AM, dart200 wrote:
On 11/5/26 9:05 AM, olcott wrote:This is a formal math problem? I thought it was a logic problem.
On 11/5/2026 11:01 AM, Dude wrote:
On 11/4/2026 1:40 PM, Chris M. Thomasson wrote:
On 11/3/2026 12:29 AM, dart200 wrote:It looks like an appeal to authority fallacy - Alan Turing.
On 11/2/26 9:26 PM, olcott wrote:
On 11/2/2026 11:08 PM, dart200 wrote:
On 11/2/26 5:17 PM, olcott wrote:
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:u don't know what an argument from authority fallacy is? >>>>>>>>>>>>>>
On 11/2/26 7:59 AM, olcott wrote:The ONLY point that I am making is the above point. >>>>>>>>>>>>>>> Every other point is a mere distraction away from >>>>>>>>>>>>>>> the above point.
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:quoting sipser is not a proof polcott:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim >>>>>>>>>>>>>>>>>>> words 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>> On 11/1/26 6:57 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>> On 11/1/2026 8:31 PM, Python wrote: >>>>>>>>>>>>>>>>>>>>>>>> Oh, come on, Peter.
There is nothing remotely mysterious here >>>>>>>>>>>>>>>>>>>>>>>> requiring some uniquely profound understanding >>>>>>>>>>>>>>>>>>>>>>>> of the "foundations of computation". >>>>>>>>>>>>>>>>>>>>>>>>
You cannot correctly leap to that conclusion. >>>>>>>>>>>>>>>>>>>>>>> Hypothesize this and I will prove it later: >>>>>>>>>>>>>>>>>>>>>>>
DD simulated by HHH is the only correct way to >>>>>>>>>>>>>>>>>>>>>>> determine
the semantic halting property of the input finite >>>>>>>>>>>>>>>>>>>>>>> string
of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here >>>>>>>>>>>>>>>>>>>>>> }-a-a-a-a-a-a-a-a-a-a-a -a // main also halts >>>>>>>>>>>>>>>>>>>>>>
If you would pay 100% complete attention >>>>>>>>>>>>>>>>>>>>> you would see that computable functions >>>>>>>>>>>>>>>>>>>>> are not allowed to do that.
Computable functions are only allowed to >>>>>>>>>>>>>>>>>>>>> report on whatever sequence of steps is >>>>>>>>>>>>>>>>>>>>> directly encoded in the finite string input. >>>>>>>>>>>>>>>>>>>>>
DD simulated by HHH never halts.
There exists no alternatives to DD simulated >>>>>>>>>>>>>>>>>>>>> by HHH to determine the behavior specified by >>>>>>>>>>>>>>>>>>>>> the input DD. Try and think of one.
right, in no universe can HHH correctly decide the >>>>>>>>>>>>>>>>>>>> halting semantics of DD when simulated by universal >>>>>>>>>>>>>>>>>>>> simulator (EYon as defined by turing), which is the >>>>>>>>>>>>>>>>>>>> halting semantics we are interested in: >>>>>>>>>>>>>>>>>>>>
-a-a-a-a If simulating halt decider H correctly simulates >>>>>>>>>>>>>>>>>>> its
-a-a-a-a input D until H correctly determines that its >>>>>>>>>>>>>>>>>>> simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>>>>>>>
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted >>>>>>>>>>>>>>>>>
right, but DD running forever is only a hypothetical. >>>>>>>>>>>>>>>
<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>>>>> 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its >>>>>>>>>>>>>>> simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>>>>
The above point almost completely proves that the >>>>>>>>>>>>>>> requirements of the above paragraph have been met. >>>>>>>>>>>>>>
I know what that deductive fallacy is on the other hand >>>>>>>>>>>>>
"An argument from authority is an inductive argument in >>>>>>>>>>>>> which the conclusion rests upon a statement made by some >>>>>>>>>>>>> presumed authority or witness... Because the testimony of a >>>>>>>>>>>>> qualified authority or witness provides a reason for >>>>>>>>>>>>> believing a claim, such arguments are often inductively >>>>>>>>>>>>> strong or cogent."
key line from sipser: H correctly determines that its >>>>>>>>>>>> simulated D would never stop running _unless aborted then_ >>>>>>>>>>>>
<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>> 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>> -a-a-a input D until H correctly determines that its simulated D >>>>>>>>>>> -a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated >>>>>>>>>>> to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
sipser himself only agreed that H is correct *unless DD is
aborted then*
ur actively ignoring the conditional on the proof, which is that >>>>>>>> H is correct if and only if D is then not aborted...
HHH aborts DD's simulation, so therefore the analysis HHH makes >>>>>>>> prior to the abort is invalidated
ur can write me off a useless troll all u want, but i'm still >>>>>>>> going to try to post helpful comments polcott. and i suggest
that ignoring the conditional is a major flaw in what ur trying >>>>>>>> to propose atm
Why the fuck do you add those two groups
cause i'm hoping u'll actually take this seriously instead of
running away again tbh???
alt.buddha.short.fat.guy''
tbh i kinda hate the dud cons that infest that group. i'm tryin to >>>>>> make them less stupid but ya know how trump loving types go eh??? >>>>>> walk around with their head up their asshole most of the day
denying basic physical facts to confirm their endlessly
narcissistic biases...
alt.messianic
just using it as a personal journal i guess??? Efn+Efn+Efn+
Have you always only been a troll?
You are smarter than him. Deal with it... ;^D
An appeal to authority fallacy (known formally as argumentum ad
verecundiam) occurs when someone claims that something must be true
simply because an authority figure, expert, or celebrity said sorCo
without offering actual evidence or logical proof.
Where's Creon?
On the other hand an appeal to a qualified expert in the field
is inductively strong.
appealing to authority has zero weight in formal math dud
Apparently, Alan Turing proved in 1936rCo1937 that the problem is undecidable (meaning no general algorithm or mathematical procedure can solve it for every possible case) using a rigorous proof by
contradiction (similar to a mathematical paradox).
On 11/5/2026 2:12 PM, dart200 wrote:
On 11/5/26 11:08 AM, olcott wrote:
On 11/5/2026 1:03 PM, dart200 wrote:
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:Your assumption that I am incorrect prevents
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way consensus" >>>>>>>>>>>>>>>>>>>> whenever someone challenges YOUR conclusions. >>>>>>>>>>>>>>>>>>>>
You can look at the record on news.giganews.com >>>>>>>>>>>>>>>>>>> where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>>>>> one from comp.theory has every agreed with anythingr >>>>>>>>>>>>>>>>>>> like this until last Sunday:
There does not exist any implementation of C function >>>>>>>>>>>>>>>>>>> HHH
that simulates C function DD according to the >>>>>>>>>>>>>>>>>>> operational
semantics of C such that the simulated C function DD >>>>>>>>>>>>>>>>>>> reaches
its own simulated return statement in any N finite >>>>>>>>>>>>>>>>>>> number of
steps.
idk why u keep repeatedly confirming the halting >>>>>>>>>>>>>>>>>> theorum, HHH cannot accurately decide on DD Efn+ >>>>>>>>>>>>>>>>>>
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles >>>>>>>>>>>>>> with the rest of them. they don't even think something is >>>>>>>>>>>>>> broken, i do
i'm just trying to get u focused in the right direction. >>>>>>>>>>>>>
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks ain't >>>>>>>>>>>>>> the right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated >>>>>>>>>>>>> final state.**
which doesn't prove anything about the nature of DD. HHH >>>>>>>>>>>> causes the end of DD's simulation, breaking the invariant >>>>>>>>>>>> that HHH not do that, as acknowledged by sipser as well >>>>>>>>>>>>
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens after >>>>>>>>>>> simulation has been aborted or we would judge that all infinite >>>>>>>>>>> loops always halt. Instead we look for a repeating state >>>>>>>>>>> while the
simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an
overgeneralization fallacy polcott. not only does HHH need to >>>>>>>>>> prove that the recursion happens, HHH needs to prove that it >>>>>>>>>> continues to happen. one can't just prove the base case in an >>>>>>>>>> inductive proof, one needs to prove it for N+1 based on the >>>>>>>>>> premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head
*This is what induction proves*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
and this doesn't prove that DD is a non-terminating machine. i
can't believe we're still arguing about this
If a computable function cannot be reduced to applying
finite string transformations to its finite string inputs
then the computation of this function is outside of the
scope of Turing computable functions in the same way
that filling your tires with air is outside the scope
of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a total
halting decider!
As it turns out to actually be this is for the
same reason that your toaster cannot fill your
tires with air.
so ur not actually disagreeing with the halting theorem?
The halting theorem does correctly prove that
your toaster cannot fill your tires with air.
It does not understand that toasters are not
supposed to fill tires with air.
Math requires things that are outside of the
scope of Turing computable functions in the
same way that toasters will not fill your
tires with air.
It has always been a stupid mistake to base the
limits of computation on what math wants instead
of what computation is and how computation works.
but the halting theorem is proven based on how computation works...
counter-factual
It only seems that way when some of the key details
are ignored by abstracting them away.
My HHH/DD leaves nothing to the imagination than
can be the basis for misconceptions or false
assumptions.
On 11/5/26 12:21 PM, olcott wrote:
On 11/5/2026 2:12 PM, dart200 wrote:
On 11/5/26 11:08 AM, olcott wrote:
On 11/5/2026 1:03 PM, dart200 wrote:
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:Your assumption that I am incorrect prevents
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote:
You write:
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way consensus" >>>>>>>>>>>>>>>>>>>>> whenever someone challenges YOUR conclusions. >>>>>>>>>>>>>>>>>>>>>
You can look at the record on news.giganews.com >>>>>>>>>>>>>>>>>>>> where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>>>>>> one from comp.theory has every agreed with anythingr >>>>>>>>>>>>>>>>>>>> like this until last Sunday:
There does not exist any implementation of C >>>>>>>>>>>>>>>>>>>> function HHH
that simulates C function DD according to the >>>>>>>>>>>>>>>>>>>> operational
semantics of C such that the simulated C function DD >>>>>>>>>>>>>>>>>>>> reaches
its own simulated return statement in any N finite >>>>>>>>>>>>>>>>>>>> number of
steps.
idk why u keep repeatedly confirming the halting >>>>>>>>>>>>>>>>>>> theorum, HHH cannot accurately decide on DD Efn+ >>>>>>>>>>>>>>>>>>>
You keep jumping ahead five steps before
I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in circles >>>>>>>>>>>>>>> with the rest of them. they don't even think something is >>>>>>>>>>>>>>> broken, i do
i'm just trying to get u focused in the right direction. >>>>>>>>>>>>>>
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks >>>>>>>>>>>>>>> ain't the right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated >>>>>>>>>>>>>> final state.**
which doesn't prove anything about the nature of DD. HHH >>>>>>>>>>>>> causes the end of DD's simulation, breaking the invariant >>>>>>>>>>>>> that HHH not do that, as acknowledged by sipser as well >>>>>>>>>>>>>
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens after >>>>>>>>>>>> simulation has been aborted or we would judge that all infinite >>>>>>>>>>>> loops always halt. Instead we look for a repeating state >>>>>>>>>>>> while the
simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an >>>>>>>>>>> overgeneralization fallacy polcott. not only does HHH need to >>>>>>>>>>> prove that the recursion happens, HHH needs to prove that it >>>>>>>>>>> continues to happen. one can't just prove the base case in an >>>>>>>>>>> inductive proof, one needs to prove it for N+1 based on the >>>>>>>>>>> premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head
*This is what induction proves*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
and this doesn't prove that DD is a non-terminating machine. i
can't believe we're still arguing about this
If a computable function cannot be reduced to applying
finite string transformations to its finite string inputs
then the computation of this function is outside of the
scope of Turing computable functions in the same way
that filling your tires with air is outside the scope
of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a total
halting decider!
As it turns out to actually be this is for the
same reason that your toaster cannot fill your
tires with air.
so ur not actually disagreeing with the halting theorem?
The halting theorem does correctly prove that
your toaster cannot fill your tires with air.
It does not understand that toasters are not
supposed to fill tires with air.
Math requires things that are outside of the
scope of Turing computable functions in the
same way that toasters will not fill your
tires with air.
i don't really get ur disagreement polcott
"math" has proven that no machine can be a total halting decider, and
HHH demonstrates quite well by failing to compute DD's correct halting semantics
It has always been a stupid mistake to base the
limits of computation on what math wants instead
of what computation is and how computation works.
but the halting theorem is proven based on how computation works...
counter-factual
It only seems that way when some of the key details
are ignored by abstracting them away.
My HHH/DD leaves nothing to the imagination than
can be the basis for misconceptions or false
assumptions.
On 11/5/2026 2:59 PM, dart200 wrote:
On 11/5/26 12:21 PM, olcott wrote:
On 11/5/2026 2:12 PM, dart200 wrote:
On 11/5/26 11:08 AM, olcott wrote:
On 11/5/2026 1:03 PM, dart200 wrote:
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:Your assumption that I am incorrect prevents
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote: >>>>>>>>>>>>>>>>>>>>>> You write:
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way consensus" >>>>>>>>>>>>>>>>>>>>>> whenever someone challenges YOUR conclusions. >>>>>>>>>>>>>>>>>>>>>>
You can look at the record on news.giganews.com >>>>>>>>>>>>>>>>>>>>> where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>>>>>>> one from comp.theory has every agreed with anythingr >>>>>>>>>>>>>>>>>>>>> like this until last Sunday:
There does not exist any implementation of C >>>>>>>>>>>>>>>>>>>>> function HHH
that simulates C function DD according to the >>>>>>>>>>>>>>>>>>>>> operational
semantics of C such that the simulated C function >>>>>>>>>>>>>>>>>>>>> DD reaches
its own simulated return statement in any N finite >>>>>>>>>>>>>>>>>>>>> number of
steps.
idk why u keep repeatedly confirming the halting >>>>>>>>>>>>>>>>>>>> theorum, HHH cannot accurately decide on DD Efn+ >>>>>>>>>>>>>>>>>>>>
You keep jumping ahead five steps before >>>>>>>>>>>>>>>>>>> I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in >>>>>>>>>>>>>>>> circles with the rest of them. they don't even think >>>>>>>>>>>>>>>> something is broken, i do
i'm just trying to get u focused in the right direction. >>>>>>>>>>>>>>>
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks >>>>>>>>>>>>>>>> ain't the right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated >>>>>>>>>>>>>>> final state.**
which doesn't prove anything about the nature of DD. HHH >>>>>>>>>>>>>> causes the end of DD's simulation, breaking the invariant >>>>>>>>>>>>>> that HHH not do that, as acknowledged by sipser as well >>>>>>>>>>>>>>
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens >>>>>>>>>>>>> after
simulation has been aborted or we would judge that all >>>>>>>>>>>>> infinite
loops always halt. Instead we look for a repeating state >>>>>>>>>>>>> while the
simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an >>>>>>>>>>>> overgeneralization fallacy polcott. not only does HHH need >>>>>>>>>>>> to prove that the recursion happens, HHH needs to prove that >>>>>>>>>>>> it continues to happen. one can't just prove the base case >>>>>>>>>>>> in an inductive proof, one needs to prove it for N+1 based >>>>>>>>>>>> on the premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head
*This is what induction proves*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches >>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>> steps.
and this doesn't prove that DD is a non-terminating machine. i >>>>>>>> can't believe we're still arguing about this
If a computable function cannot be reduced to applying
finite string transformations to its finite string inputs
then the computation of this function is outside of the
scope of Turing computable functions in the same way
that filling your tires with air is outside the scope
of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a total
halting decider!
As it turns out to actually be this is for the
same reason that your toaster cannot fill your
tires with air.
so ur not actually disagreeing with the halting theorem?
The halting theorem does correctly prove that
your toaster cannot fill your tires with air.
It does not understand that toasters are not
supposed to fill tires with air.
Math requires things that are outside of the
scope of Turing computable functions in the
same way that toasters will not fill your
tires with air.
i don't really get ur disagreement polcott
"math" has proven that no machine can be a total halting decider, and
HHH demonstrates quite well by failing to compute DD's correct halting
semantics
Right and math can equally prove that no Turing
machine is a plate of spaghetti.
It has always been a stupid mistake to base the
limits of computation on what math wants instead
of what computation is and how computation works.
but the halting theorem is proven based on how computation works...
counter-factual
It only seems that way when some of the key details
are ignored by abstracting them away.
My HHH/DD leaves nothing to the imagination than
can be the basis for misconceptions or false
assumptions.
On 11/5/26 1:06 PM, olcott wrote:
On 11/5/2026 2:59 PM, dart200 wrote:
On 11/5/26 12:21 PM, olcott wrote:
On 11/5/2026 2:12 PM, dart200 wrote:
On 11/5/26 11:08 AM, olcott wrote:
On 11/5/2026 1:03 PM, dart200 wrote:
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:Your assumption that I am incorrect prevents
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote:
On 11/3/26 2:40 PM, olcott wrote:
On 11/3/2026 4:33 PM, Python wrote: >>>>>>>>>>>>>>>>>>>>>>> You write:
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way consensus" >>>>>>>>>>>>>>>>>>>>>>> whenever someone challenges YOUR conclusions. >>>>>>>>>>>>>>>>>>>>>>>
You can look at the record on news.giganews.com >>>>>>>>>>>>>>>>>>>>>> where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>>>>>>>> one from comp.theory has every agreed with anythingr >>>>>>>>>>>>>>>>>>>>>> like this until last Sunday:
There does not exist any implementation of C >>>>>>>>>>>>>>>>>>>>>> function HHH
that simulates C function DD according to the >>>>>>>>>>>>>>>>>>>>>> operational
semantics of C such that the simulated C function >>>>>>>>>>>>>>>>>>>>>> DD reaches
its own simulated return statement in any N finite >>>>>>>>>>>>>>>>>>>>>> number of
steps.
idk why u keep repeatedly confirming the halting >>>>>>>>>>>>>>>>>>>>> theorum, HHH cannot accurately decide on DD Efn+ >>>>>>>>>>>>>>>>>>>>>
You keep jumping ahead five steps before >>>>>>>>>>>>>>>>>>>> I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in >>>>>>>>>>>>>>>>> circles with the rest of them. they don't even think >>>>>>>>>>>>>>>>> something is broken, i do
i'm just trying to get u focused in the right direction. >>>>>>>>>>>>>>>>
you from understanding what I am saying.
failing to acknowledge the invariant ur proof breaks >>>>>>>>>>>>>>>>> ain't the right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated >>>>>>>>>>>>>>>> final state.**
which doesn't prove anything about the nature of DD. HHH >>>>>>>>>>>>>>> causes the end of DD's simulation, breaking the invariant >>>>>>>>>>>>>>> that HHH not do that, as acknowledged by sipser as well >>>>>>>>>>>>>>>
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens >>>>>>>>>>>>>> after
simulation has been aborted or we would judge that all >>>>>>>>>>>>>> infinite
loops always halt. Instead we look for a repeating state >>>>>>>>>>>>>> while the
simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an >>>>>>>>>>>>> overgeneralization fallacy polcott. not only does HHH need >>>>>>>>>>>>> to prove that the recursion happens, HHH needs to prove >>>>>>>>>>>>> that it continues to happen. one can't just prove the base >>>>>>>>>>>>> case in an inductive proof, one needs to prove it for N+1 >>>>>>>>>>>>> based on the premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head
*This is what induction proves*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches >>>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>>> steps.
and this doesn't prove that DD is a non-terminating machine. i >>>>>>>>> can't believe we're still arguing about this
If a computable function cannot be reduced to applying
finite string transformations to its finite string inputs
then the computation of this function is outside of the
scope of Turing computable functions in the same way
that filling your tires with air is outside the scope
of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a total
halting decider!
As it turns out to actually be this is for the
same reason that your toaster cannot fill your
tires with air.
so ur not actually disagreeing with the halting theorem?
The halting theorem does correctly prove that
your toaster cannot fill your tires with air.
It does not understand that toasters are not
supposed to fill tires with air.
Math requires things that are outside of the
scope of Turing computable functions in the
same way that toasters will not fill your
tires with air.
i don't really get ur disagreement polcott
"math" has proven that no machine can be a total halting decider, and
HHH demonstrates quite well by failing to compute DD's correct
halting semantics
Right and math can equally prove that no Turing
machine is a plate of spaghetti.
polcott, it's a very reasonable to be concerned about computing/proving
the true halting semantics of any given machine
i'm not sure what ur disagreement is
It has always been a stupid mistake to base the
limits of computation on what math wants instead
of what computation is and how computation works.
but the halting theorem is proven based on how computation works...
counter-factual
It only seems that way when some of the key details
are ignored by abstracting them away.
My HHH/DD leaves nothing to the imagination than
can be the basis for misconceptions or false
assumptions.
On 11/5/2026 3:12 PM, dart200 wrote:
On 11/5/26 1:06 PM, olcott wrote:
On 11/5/2026 2:59 PM, dart200 wrote:
On 11/5/26 12:21 PM, olcott wrote:
On 11/5/2026 2:12 PM, dart200 wrote:
On 11/5/26 11:08 AM, olcott wrote:
On 11/5/2026 1:03 PM, dart200 wrote:
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:Your assumption that I am incorrect prevents >>>>>>>>>>>>>>>>> you from understanding what I am saying.
On 11/3/2026 5:32 PM, dart200 wrote:
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>> On 11/3/26 2:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 4:33 PM, Python wrote: >>>>>>>>>>>>>>>>>>>>>>>> You write:
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way consensus" >>>>>>>>>>>>>>>>>>>>>>>> whenever someone challenges YOUR conclusions. >>>>>>>>>>>>>>>>>>>>>>>>
You can look at the record on news.giganews.com >>>>>>>>>>>>>>>>>>>>>>> where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>>>>>>>>> one from comp.theory has every agreed with anythingr >>>>>>>>>>>>>>>>>>>>>>> like this until last Sunday:
There does not exist any implementation of C >>>>>>>>>>>>>>>>>>>>>>> function HHH
that simulates C function DD according to the >>>>>>>>>>>>>>>>>>>>>>> operational
semantics of C such that the simulated C function >>>>>>>>>>>>>>>>>>>>>>> DD reaches
its own simulated return statement in any N >>>>>>>>>>>>>>>>>>>>>>> finite number of
steps.
idk why u keep repeatedly confirming the halting >>>>>>>>>>>>>>>>>>>>>> theorum, HHH cannot accurately decide on DD Efn+ >>>>>>>>>>>>>>>>>>>>>>
You keep jumping ahead five steps before >>>>>>>>>>>>>>>>>>>>> I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while.
idk why u like wasting so much time on running in >>>>>>>>>>>>>>>>>> circles with the rest of them. they don't even think >>>>>>>>>>>>>>>>>> something is broken, i do
i'm just trying to get u focused in the right direction. >>>>>>>>>>>>>>>>>
failing to acknowledge the invariant ur proof breaks >>>>>>>>>>>>>>>>>> ain't the right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated >>>>>>>>>>>>>>>>> final state.**
which doesn't prove anything about the nature of DD. HHH >>>>>>>>>>>>>>>> causes the end of DD's simulation, breaking the >>>>>>>>>>>>>>>> invariant that HHH not do that, as acknowledged by >>>>>>>>>>>>>>>> sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what happens >>>>>>>>>>>>>>> after
simulation has been aborted or we would judge that all >>>>>>>>>>>>>>> infinite
loops always halt. Instead we look for a repeating state >>>>>>>>>>>>>>> while the
simulation continues.
that is not a definition of the word "invariant"
and this is just an inductive failure resulting from an >>>>>>>>>>>>>> overgeneralization fallacy polcott. not only does HHH need >>>>>>>>>>>>>> to prove that the recursion happens, HHH needs to prove >>>>>>>>>>>>>> that it continues to happen. one can't just prove the base >>>>>>>>>>>>>> case in an inductive proof, one needs to prove it for N+1 >>>>>>>>>>>>>> based on the premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head
*This is what induction proves*
There does not exist any implementation of C function HHH >>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>> semantics of C such that the simulated C function DD reaches >>>>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>>>> steps.
and this doesn't prove that DD is a non-terminating machine. i >>>>>>>>>> can't believe we're still arguing about this
If a computable function cannot be reduced to applying
finite string transformations to its finite string inputs
then the computation of this function is outside of the
scope of Turing computable functions in the same way
that filling your tires with air is outside the scope
of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a total >>>>>>>> halting decider!
As it turns out to actually be this is for the
same reason that your toaster cannot fill your
tires with air.
so ur not actually disagreeing with the halting theorem?
The halting theorem does correctly prove that
your toaster cannot fill your tires with air.
It does not understand that toasters are not
supposed to fill tires with air.
Math requires things that are outside of the
scope of Turing computable functions in the
same way that toasters will not fill your
tires with air.
i don't really get ur disagreement polcott
"math" has proven that no machine can be a total halting decider,
and HHH demonstrates quite well by failing to compute DD's correct
halting semantics
Right and math can equally prove that no Turing
machine is a plate of spaghetti.
polcott, it's a very reasonable to be concerned about computing/
proving the true halting semantics of any given machine
i'm not sure what ur disagreement is
Math asks for the logically impossible and then
blames computation when this request is not fulfilled.
When the request is properly framed as finite
string transformation rules applied to finite
string inputs then this request can be fulfilled.
It has always been a stupid mistake to base the
limits of computation on what math wants instead
of what computation is and how computation works.
but the halting theorem is proven based on how computation works... >>>>>>
counter-factual
It only seems that way when some of the key details
are ignored by abstracting them away.
My HHH/DD leaves nothing to the imagination than
can be the basis for misconceptions or false
assumptions.
On 11/5/26 1:37 PM, olcott wrote:
On 11/5/2026 3:12 PM, dart200 wrote:
On 11/5/26 1:06 PM, olcott wrote:
On 11/5/2026 2:59 PM, dart200 wrote:
On 11/5/26 12:21 PM, olcott wrote:
On 11/5/2026 2:12 PM, dart200 wrote:
On 11/5/26 11:08 AM, olcott wrote:
On 11/5/2026 1:03 PM, dart200 wrote:
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:Your assumption that I am incorrect prevents >>>>>>>>>>>>>>>>>> you from understanding what I am saying.
On 11/3/2026 5:32 PM, dart200 wrote:idk why u like wasting so much time on running in >>>>>>>>>>>>>>>>>>> circles with the rest of them. they don't even think >>>>>>>>>>>>>>>>>>> something is broken, i do
On 11/3/26 2:59 PM, olcott wrote:
On 11/3/2026 4:56 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>>> On 11/3/26 2:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 4:33 PM, Python wrote: >>>>>>>>>>>>>>>>>>>>>>>>> You write:
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way consensus" >>>>>>>>>>>>>>>>>>>>>>>>> whenever someone challenges YOUR conclusions. >>>>>>>>>>>>>>>>>>>>>>>>>
You can look at the record on news.giganews.com >>>>>>>>>>>>>>>>>>>>>>>> where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>>>>>>>>>> one from comp.theory has every agreed with >>>>>>>>>>>>>>>>>>>>>>>> anythingr
like this until last Sunday:
There does not exist any implementation of C >>>>>>>>>>>>>>>>>>>>>>>> function HHH
that simulates C function DD according to the >>>>>>>>>>>>>>>>>>>>>>>> operational
semantics of C such that the simulated C >>>>>>>>>>>>>>>>>>>>>>>> function DD reaches
its own simulated return statement in any N >>>>>>>>>>>>>>>>>>>>>>>> finite number of
steps.
idk why u keep repeatedly confirming the halting >>>>>>>>>>>>>>>>>>>>>>> theorum, HHH cannot accurately decide on DD Efn+ >>>>>>>>>>>>>>>>>>>>>>>
You keep jumping ahead five steps before >>>>>>>>>>>>>>>>>>>>>> I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while. >>>>>>>>>>>>>>>>>>>
i'm just trying to get u focused in the right direction. >>>>>>>>>>>>>>>>>>
failing to acknowledge the invariant ur proof breaks >>>>>>>>>>>>>>>>>>> ain't the right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own simulated >>>>>>>>>>>>>>>>>> final state.**
which doesn't prove anything about the nature of DD. >>>>>>>>>>>>>>>>> HHH causes the end of DD's simulation, breaking the >>>>>>>>>>>>>>>>> invariant that HHH not do that, as acknowledged by >>>>>>>>>>>>>>>>> sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what >>>>>>>>>>>>>>>> happens after
simulation has been aborted or we would judge that all >>>>>>>>>>>>>>>> infinite
loops always halt. Instead we look for a repeating state >>>>>>>>>>>>>>>> while the
simulation continues.
that is not a definition of the word "invariant" >>>>>>>>>>>>>>>
and this is just an inductive failure resulting from an >>>>>>>>>>>>>>> overgeneralization fallacy polcott. not only does HHH >>>>>>>>>>>>>>> need to prove that the recursion happens, HHH needs to >>>>>>>>>>>>>>> prove that it continues to happen. one can't just prove >>>>>>>>>>>>>>> the base case in an inductive proof, one needs to prove >>>>>>>>>>>>>>> it for N+1 based on the premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head >>>>>>>>>>>>>
*This is what induction proves*
There does not exist any implementation of C function HHH >>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>> semantics of C such that the simulated C function DD reaches >>>>>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>>>>> steps.
and this doesn't prove that DD is a non-terminating machine. >>>>>>>>>>> i can't believe we're still arguing about this
If a computable function cannot be reduced to applying
finite string transformations to its finite string inputs
then the computation of this function is outside of the
scope of Turing computable functions in the same way
that filling your tires with air is outside the scope
of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a total >>>>>>>>> halting decider!
As it turns out to actually be this is for the
same reason that your toaster cannot fill your
tires with air.
so ur not actually disagreeing with the halting theorem?
The halting theorem does correctly prove that
your toaster cannot fill your tires with air.
It does not understand that toasters are not
supposed to fill tires with air.
Math requires things that are outside of the
scope of Turing computable functions in the
same way that toasters will not fill your
tires with air.
i don't really get ur disagreement polcott
"math" has proven that no machine can be a total halting decider,
and HHH demonstrates quite well by failing to compute DD's correct
halting semantics
Right and math can equally prove that no Turing
machine is a plate of spaghetti.
polcott, it's a very reasonable to be concerned about computing/
proving the true halting semantics of any given machine
i'm not sure what ur disagreement is
Math asks for the logically impossible and then
the theory of computing is part of math
blames computation when this request is not fulfilled.
blame??? it's not blame, it's proof based on the idiosyncrasies of self- referential analysis
When the request is properly framed as finite
string transformation rules applied to finite
string inputs then this request can be fulfilled.
polcott, HHH(DD) returning 0 does not match the objective halting
semantics of DD, which is that DD halts
HHH(DD)->0 has not fulfilled the request of computing the objective
halting semantics of DD
It has always been a stupid mistake to base the
limits of computation on what math wants instead
of what computation is and how computation works.
but the halting theorem is proven based on how computation works... >>>>>>>
counter-factual
It only seems that way when some of the key details
are ignored by abstracting them away.
My HHH/DD leaves nothing to the imagination than
can be the basis for misconceptions or false
assumptions.
On 11/3/2026 12:29 AM, dart200 wrote:.
On 11/2/26 9:26 PM, olcott wrote:
On 11/2/2026 11:08 PM, dart200 wrote:
On 11/2/26 5:17 PM, olcott wrote:
On 11/2/2026 7:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:quoting sipser is not a proof polcott:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring >>>>>>>>>>>>>>>>>>>> some uniquely profound understanding of the >>>>>>>>>>>>>>>>>>>> "foundations of computation".
You cannot correctly leap to that conclusion. >>>>>>>>>>>>>>>>>>> Hypothesize this and I will prove it later: >>>>>>>>>>>>>>>>>>>
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts >>>>>>>>>>>>>>>>>>
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input. >>>>>>>>>>>>>>>>>
DD simulated by HHH never halts.
There exists no alternatives to DD simulated >>>>>>>>>>>>>>>>> by HHH to determine the behavior specified by >>>>>>>>>>>>>>>>> the input DD. Try and think of one.
right, in no universe can HHH correctly decide the >>>>>>>>>>>>>>>> halting semantics of DD when simulated by universal >>>>>>>>>>>>>>>> simulator (EYon as defined by turing), which is the halting >>>>>>>>>>>>>>>> semantics we are interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its >>>>>>>>>>>>>>> simulated D
-a-a-a-a would never stop running unless aborted then >>>>>>>>>>>>>>
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted >>>>>>>>>>>>>
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>> 10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which >>>>>>>>> the conclusion rests upon a statement made by some presumed >>>>>>>>> authority or witness... Because the testimony of a qualified >>>>>>>>> authority or witness provides a reason for believing a claim, >>>>>>>>> such arguments are often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated >>>>>>>> D would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D >>>>>>> -a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
whatever follows the then is stipulated to be correct
sipser himself only agreed that H is correct *unless DD is aborted
then*
ur actively ignoring the conditional on the proof, which is that H
is correct if and only if D is then not aborted...
HHH aborts DD's simulation, so therefore the analysis HHH makes
prior to the abort is invalidated
ur can write me off a useless troll all u want, but i'm still going
to try to post helpful comments polcott. and i suggest that ignoring
the conditional is a major flaw in what ur trying to propose atm
Why the fuck do you add those two groups
cause i'm hoping u'll actually take this seriously instead of running
away again tbh???
alt.buddha.short.fat.guy''
tbh i kinda hate the dud cons that infest that group. i'm tryin to
make them less stupid but ya know how trump loving types go eh??? walk
around with their head up their asshole most of the day denying basic
physical facts to confirm their endlessly narcissistic biases...
alt.messianic
just using it as a personal journal i guess??? Efn+Efn+Efn+
Have you always only been a troll?
You are smarter than him. Deal with it... ;^D
On 11/2/26 9:16 PM, Chris M. Thomasson wrote:
On 11/2/2026 5:14 PM, dart200 wrote:
On 11/2/26 4:49 PM, olcott wrote:
On 11/2/2026 6:02 PM, dart200 wrote:key phrase from sipser: ...unless aborted _then_
On 11/2/26 9:37 AM, olcott wrote:
On 11/2/2026 11:18 AM, dart200 wrote:
On 11/2/26 9:08 AM, olcott wrote:
On 11/2/2026 10:59 AM, dart200 wrote:
On 11/2/26 7:59 AM, olcott wrote:
On 11/2/2026 9:38 AM, dart200 wrote:
On 11/2/26 6:16 AM, olcott wrote:
On 11/2/2026 2:32 AM, dart200 wrote:
On 11/1/26 8:23 PM, olcott wrote:<MIT Professor Sipser agreed to ONLY these verbatim words >>>>>>>>>>>> 10/13/2022>
On 11/1/2026 10:06 PM, dart200 wrote:
On 11/1/26 6:57 PM, olcott wrote:
On 11/1/2026 8:31 PM, Python wrote:
Oh, come on, Peter.
There is nothing remotely mysterious here requiring >>>>>>>>>>>>>>>>> some uniquely profound understanding of the >>>>>>>>>>>>>>>>> "foundations of computation".
You cannot correctly leap to that conclusion.
Hypothesize this and I will prove it later:
DD simulated by HHH is the only correct way to determine >>>>>>>>>>>>>>>> the semantic halting property of the input finite string >>>>>>>>>>>>>>>> of source code.
HHH still doesn't actually determine was DD does >>>>>>>>>>>>>>>
int main() {
-a-a DD()-a-a-a-a-a-a-a // DD halts here
}-a-a-a-a-a-a-a-a-a-a-a -a // main also halts
If you would pay 100% complete attention
you would see that computable functions
are not allowed to do that.
Computable functions are only allowed to
report on whatever sequence of steps is
directly encoded in the finite string input.
DD simulated by HHH never halts.
There exists no alternatives to DD simulated
by HHH to determine the behavior specified by
the input DD. Try and think of one.
right, in no universe can HHH correctly decide the halting >>>>>>>>>>>>> semantics of DD when simulated by universal simulator (EYon as >>>>>>>>>>>>> defined by turing), which is the halting semantics we are >>>>>>>>>>>>> interested in:
-a-a-a-a If simulating halt decider H correctly simulates its >>>>>>>>>>>> -a-a-a-a input D until H correctly determines that its simulated D >>>>>>>>>>>> -a-a-a-a would never stop running unless aborted then
quoting sipser is not a proof polcott:
On 11/2/2026 8:50 AM, Python wrote:
-a-a-a-a WHILE THE SIMULATION CONTINUES,
-a-a-a-a DD DOES NOT REACH ITS RETURN.
Does entail (even if no one agrees)
its simulated D would never stop running unless aborted
right, but DD running forever is only a hypothetical.
The ONLY point that I am making is the above point.
Every other point is a mere distraction away from
the above point.
<MIT Professor Sipser agreed to ONLY these verbatim words
10/13/2022>
-a-a-a-a If simulating halt decider H correctly simulates its
-a-a-a-a input D until H correctly determines that its simulated D >>>>>>>> -a-a-a-a would never stop running unless aborted then
The above point almost completely proves that the
requirements of the above paragraph have been met.
u don't know what an argument from authority fallacy is?
I know what that deductive fallacy is on the other hand
"An argument from authority is an inductive argument in which the >>>>>> conclusion rests upon a statement made by some presumed authority >>>>>> or witness... Because the testimony of a qualified authority or
witness provides a reason for believing a claim, such arguments
are often inductively strong or cogent."
key line from sipser: H correctly determines that its simulated D
would never stop running _unless aborted then_
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-a-a-a If simulating halt decider H correctly simulates its
-a-a-a input D until H correctly determines that its simulated D
-a-a-a would never stop running unless aborted then
What HHH does after verifying that the above paragraph
conditions have been met is irrelevant. When these
conditions have been met what follows them is stipulated
to be correct.
the "then" refers to aborting after the recursion is detected. sipser
provides an exception to the correctness of the decision, explicitly
if the simulation is _then_ aborted after the determination is made.
this is what HHH does, and therefore the analysis by HHH of DD is
invalidated
it sucks to be wrong polcott, but it's better to admit ur wrong than
continue being wrong, this is know from experience
Sage advice.
could u ever have foreseen sage advice coming from me chris?
On 11/5/2026 3:45 PM, dart200 wrote:
On 11/5/26 1:37 PM, olcott wrote:
On 11/5/2026 3:12 PM, dart200 wrote:
On 11/5/26 1:06 PM, olcott wrote:
On 11/5/2026 2:59 PM, dart200 wrote:
On 11/5/26 12:21 PM, olcott wrote:
On 11/5/2026 2:12 PM, dart200 wrote:
On 11/5/26 11:08 AM, olcott wrote:
On 11/5/2026 1:03 PM, dart200 wrote:
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote:
On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>> On 11/3/26 2:59 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 4:56 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 11/3/26 2:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 4:33 PM, Python wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> You write:idk why u like wasting so much time on running in >>>>>>>>>>>>>>>>>>>> circles with the rest of them. they don't even think >>>>>>>>>>>>>>>>>>>> something is broken, i do
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way >>>>>>>>>>>>>>>>>>>>>>>>>> consensus" whenever someone challenges YOUR >>>>>>>>>>>>>>>>>>>>>>>>>> conclusions.
You can look at the record on news.giganews.com >>>>>>>>>>>>>>>>>>>>>>>>> where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>>>>>>>>>>> one from comp.theory has every agreed with >>>>>>>>>>>>>>>>>>>>>>>>> anythingr
like this until last Sunday: >>>>>>>>>>>>>>>>>>>>>>>>>
There does not exist any implementation of C >>>>>>>>>>>>>>>>>>>>>>>>> function HHH
that simulates C function DD according to the >>>>>>>>>>>>>>>>>>>>>>>>> operational
semantics of C such that the simulated C >>>>>>>>>>>>>>>>>>>>>>>>> function DD reaches
its own simulated return statement in any N >>>>>>>>>>>>>>>>>>>>>>>>> finite number of
steps.
idk why u keep repeatedly confirming the halting >>>>>>>>>>>>>>>>>>>>>>>> theorum, HHH cannot accurately decide on DD Efn+ >>>>>>>>>>>>>>>>>>>>>>>>
You keep jumping ahead five steps before >>>>>>>>>>>>>>>>>>>>>>> I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while. >>>>>>>>>>>>>>>>>>>>
i'm just trying to get u focused in the right >>>>>>>>>>>>>>>>>>>> direction.
Your assumption that I am incorrect prevents >>>>>>>>>>>>>>>>>>> you from understanding what I am saying. >>>>>>>>>>>>>>>>>>>
failing to acknowledge the invariant ur proof breaks >>>>>>>>>>>>>>>>>>>> ain't the right direction polcott
**Simulation invariant**
**DD simulated by HHH does not reach its own >>>>>>>>>>>>>>>>>>> simulated final state.**
which doesn't prove anything about the nature of DD. >>>>>>>>>>>>>>>>>> HHH causes the end of DD's simulation, breaking the >>>>>>>>>>>>>>>>>> invariant that HHH not do that, as acknowledged by >>>>>>>>>>>>>>>>>> sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what >>>>>>>>>>>>>>>>> happens after
simulation has been aborted or we would judge that all >>>>>>>>>>>>>>>>> infinite
loops always halt. Instead we look for a repeating >>>>>>>>>>>>>>>>> state while the
simulation continues.
that is not a definition of the word "invariant" >>>>>>>>>>>>>>>>
and this is just an inductive failure resulting from an >>>>>>>>>>>>>>>> overgeneralization fallacy polcott. not only does HHH >>>>>>>>>>>>>>>> need to prove that the recursion happens, HHH needs to >>>>>>>>>>>>>>>> prove that it continues to happen. one can't just prove >>>>>>>>>>>>>>>> the base case in an inductive proof, one needs to prove >>>>>>>>>>>>>>>> it for N+1 based on the premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head >>>>>>>>>>>>>>
*This is what induction proves*
There does not exist any implementation of C function HHH >>>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>>> semantics of C such that the simulated C function DD reaches >>>>>>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>>>>>> steps.
and this doesn't prove that DD is a non-terminating machine. >>>>>>>>>>>> i can't believe we're still arguing about this
If a computable function cannot be reduced to applying
finite string transformations to its finite string inputs >>>>>>>>>>> then the computation of this function is outside of the
scope of Turing computable functions in the same way
that filling your tires with air is outside the scope
of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a total >>>>>>>>>> halting decider!
As it turns out to actually be this is for the
same reason that your toaster cannot fill your
tires with air.
so ur not actually disagreeing with the halting theorem?
The halting theorem does correctly prove that
your toaster cannot fill your tires with air.
It does not understand that toasters are not
supposed to fill tires with air.
Math requires things that are outside of the
scope of Turing computable functions in the
same way that toasters will not fill your
tires with air.
i don't really get ur disagreement polcott
"math" has proven that no machine can be a total halting decider, >>>>>> and HHH demonstrates quite well by failing to compute DD's correct >>>>>> halting semantics
Right and math can equally prove that no Turing
machine is a plate of spaghetti.
polcott, it's a very reasonable to be concerned about computing/
proving the true halting semantics of any given machine
i'm not sure what ur disagreement is
Math asks for the logically impossible and then
the theory of computing is part of math
blames computation when this request is not fulfilled.
blame??? it's not blame, it's proof based on the idiosyncrasies of
self- referential analysis
The math requirements of a halt decider are outside
the scope of finite string transformation rules
applied to finite string inputs
in the same way as
the requirements that your toaster to fill your
tires with air are outside the scope of toasters.
When the request is properly framed as finite
string transformation rules applied to finite
string inputs then this request can be fulfilled.
polcott, HHH(DD) returning 0 does not match the objective halting
semantics of DD, which is that DD halts
HHH(DD)->0 has not fulfilled the request of computing the objective
halting semantics of DD
It has always been a stupid mistake to base the
limits of computation on what math wants instead
of what computation is and how computation works.
but the halting theorem is proven based on how computation works... >>>>>>>>
counter-factual
It only seems that way when some of the key details
are ignored by abstracting them away.
My HHH/DD leaves nothing to the imagination than
can be the basis for misconceptions or false
assumptions.
On 11/5/26 1:55 PM, olcott wrote:
On 11/5/2026 3:45 PM, dart200 wrote:
On 11/5/26 1:37 PM, olcott wrote:
On 11/5/2026 3:12 PM, dart200 wrote:
On 11/5/26 1:06 PM, olcott wrote:
On 11/5/2026 2:59 PM, dart200 wrote:
On 11/5/26 12:21 PM, olcott wrote:
On 11/5/2026 2:12 PM, dart200 wrote:
On 11/5/26 11:08 AM, olcott wrote:
On 11/5/2026 1:03 PM, dart200 wrote:
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:
On 11/4/2026 12:49 AM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>> On 11/3/26 3:36 PM, olcott wrote:
On 11/3/2026 5:32 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>>> On 11/3/26 2:59 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 4:56 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/26 2:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 4:33 PM, Python wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> You write:idk why u like wasting so much time on running in >>>>>>>>>>>>>>>>>>>>> circles with the rest of them. they don't even >>>>>>>>>>>>>>>>>>>>> think something is broken, i do
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way >>>>>>>>>>>>>>>>>>>>>>>>>>> consensus" whenever someone challenges YOUR >>>>>>>>>>>>>>>>>>>>>>>>>>> conclusions.
You can look at the record on news.giganews.com >>>>>>>>>>>>>>>>>>>>>>>>>> where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>>>>>>>>>>>> one from comp.theory has every agreed with >>>>>>>>>>>>>>>>>>>>>>>>>> anythingr
like this until last Sunday: >>>>>>>>>>>>>>>>>>>>>>>>>>
There does not exist any implementation of C >>>>>>>>>>>>>>>>>>>>>>>>>> function HHH
that simulates C function DD according to the >>>>>>>>>>>>>>>>>>>>>>>>>> operational
semantics of C such that the simulated C >>>>>>>>>>>>>>>>>>>>>>>>>> function DD reaches
its own simulated return statement in any N >>>>>>>>>>>>>>>>>>>>>>>>>> finite number of
steps.
idk why u keep repeatedly confirming the >>>>>>>>>>>>>>>>>>>>>>>>> halting theorum, HHH cannot accurately decide >>>>>>>>>>>>>>>>>>>>>>>>> on DD Efn+
You keep jumping ahead five steps before >>>>>>>>>>>>>>>>>>>>>>>> I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while. >>>>>>>>>>>>>>>>>>>>>
i'm just trying to get u focused in the right >>>>>>>>>>>>>>>>>>>>> direction.
Your assumption that I am incorrect prevents >>>>>>>>>>>>>>>>>>>> you from understanding what I am saying. >>>>>>>>>>>>>>>>>>>>
failing to acknowledge the invariant ur proof >>>>>>>>>>>>>>>>>>>>> breaks ain't the right direction polcott >>>>>>>>>>>>>>>>>>>>>
**Simulation invariant**
**DD simulated by HHH does not reach its own >>>>>>>>>>>>>>>>>>>> simulated final state.**
which doesn't prove anything about the nature of DD. >>>>>>>>>>>>>>>>>>> HHH causes the end of DD's simulation, breaking the >>>>>>>>>>>>>>>>>>> invariant that HHH not do that, as acknowledged by >>>>>>>>>>>>>>>>>>> sipser as well
what does invariant mean to you polcott?
We cannot ever judge halting on the basis of what >>>>>>>>>>>>>>>>>> happens after
simulation has been aborted or we would judge that all >>>>>>>>>>>>>>>>>> infinite
loops always halt. Instead we look for a repeating >>>>>>>>>>>>>>>>>> state while the
simulation continues.
that is not a definition of the word "invariant" >>>>>>>>>>>>>>>>>
and this is just an inductive failure resulting from an >>>>>>>>>>>>>>>>> overgeneralization fallacy polcott. not only does HHH >>>>>>>>>>>>>>>>> need to prove that the recursion happens, HHH needs to >>>>>>>>>>>>>>>>> prove that it continues to happen. one can't just prove >>>>>>>>>>>>>>>>> the base case in an inductive proof, one needs to prove >>>>>>>>>>>>>>>>> it for N+1 based on the premise of it for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head >>>>>>>>>>>>>>>
*This is what induction proves*
There does not exist any implementation of C function HHH >>>>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>>>> semantics of C such that the simulated C function DD reaches >>>>>>>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>>>>>>> steps.
and this doesn't prove that DD is a non-terminating >>>>>>>>>>>>> machine. i can't believe we're still arguing about this >>>>>>>>>>>>>
If a computable function cannot be reduced to applying >>>>>>>>>>>> finite string transformations to its finite string inputs >>>>>>>>>>>> then the computation of this function is outside of the >>>>>>>>>>>> scope of Turing computable functions in the same way
that filling your tires with air is outside the scope
of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a total >>>>>>>>>>> halting decider!
As it turns out to actually be this is for the
same reason that your toaster cannot fill your
tires with air.
so ur not actually disagreeing with the halting theorem?
The halting theorem does correctly prove that
your toaster cannot fill your tires with air.
It does not understand that toasters are not
supposed to fill tires with air.
Math requires things that are outside of the
scope of Turing computable functions in the
same way that toasters will not fill your
tires with air.
i don't really get ur disagreement polcott
"math" has proven that no machine can be a total halting decider, >>>>>>> and HHH demonstrates quite well by failing to compute DD's
correct halting semantics
Right and math can equally prove that no Turing
machine is a plate of spaghetti.
polcott, it's a very reasonable to be concerned about computing/
proving the true halting semantics of any given machine
i'm not sure what ur disagreement is
Math asks for the logically impossible and then
the theory of computing is part of math
blames computation when this request is not fulfilled.
blame??? it's not blame, it's proof based on the idiosyncrasies of
self- referential analysis
The math requirements of a halt decider are outside
the scope of finite string transformation rules
applied to finite string inputs
yes, that is the halting theorem
in the same way as
the requirements that your toaster to fill your
tires with air are outside the scope of toasters.
i can't agree that an automated semantic decider is an absurd thing to desire
When the request is properly framed as finite
string transformation rules applied to finite
string inputs then this request can be fulfilled.
polcott, HHH(DD) returning 0 does not match the objective halting
semantics of DD, which is that DD halts
HHH(DD)->0 has not fulfilled the request of computing the objective
halting semantics of DD
It has always been a stupid mistake to base the
limits of computation on what math wants instead
of what computation is and how computation works.
but the halting theorem is proven based on how computation
works...
counter-factual
It only seems that way when some of the key details
are ignored by abstracting them away.
My HHH/DD leaves nothing to the imagination than
can be the basis for misconceptions or false
assumptions.
On 11/5/2026 6:50 PM, dart200 wrote:
On 11/5/26 1:55 PM, olcott wrote:
On 11/5/2026 3:45 PM, dart200 wrote:
On 11/5/26 1:37 PM, olcott wrote:
On 11/5/2026 3:12 PM, dart200 wrote:
On 11/5/26 1:06 PM, olcott wrote:
On 11/5/2026 2:59 PM, dart200 wrote:
On 11/5/26 12:21 PM, olcott wrote:
On 11/5/2026 2:12 PM, dart200 wrote:
On 11/5/26 11:08 AM, olcott wrote:
On 11/5/2026 1:03 PM, dart200 wrote:
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote:
On 11/4/26 3:10 AM, olcott wrote:We cannot ever judge halting on the basis of what >>>>>>>>>>>>>>>>>>> happens after
On 11/4/2026 12:49 AM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>> On 11/3/26 3:36 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 5:32 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 11/3/26 2:59 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 4:56 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/26 2:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 4:33 PM, Python wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> You write:
idk why u like wasting so much time on running in >>>>>>>>>>>>>>>>>>>>>> circles with the rest of them. they don't even >>>>>>>>>>>>>>>>>>>>>> think something is broken, i do
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way >>>>>>>>>>>>>>>>>>>>>>>>>>>> consensus" whenever someone challenges YOUR >>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusions.
You can look at the record on news.giganews.com >>>>>>>>>>>>>>>>>>>>>>>>>>> where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>>>>>>>>>>>>> one from comp.theory has every agreed with >>>>>>>>>>>>>>>>>>>>>>>>>>> anythingr
like this until last Sunday: >>>>>>>>>>>>>>>>>>>>>>>>>>>
There does not exist any implementation of C >>>>>>>>>>>>>>>>>>>>>>>>>>> function HHH
that simulates C function DD according to the >>>>>>>>>>>>>>>>>>>>>>>>>>> operational
semantics of C such that the simulated C >>>>>>>>>>>>>>>>>>>>>>>>>>> function DD reaches
its own simulated return statement in any N >>>>>>>>>>>>>>>>>>>>>>>>>>> finite number of
steps.
idk why u keep repeatedly confirming the >>>>>>>>>>>>>>>>>>>>>>>>>> halting theorum, HHH cannot accurately decide >>>>>>>>>>>>>>>>>>>>>>>>>> on DD Efn+
You keep jumping ahead five steps before >>>>>>>>>>>>>>>>>>>>>>>>> I establish my basis.
there's no basis here polcott
OK I am done talking to you for a while. >>>>>>>>>>>>>>>>>>>>>>
i'm just trying to get u focused in the right >>>>>>>>>>>>>>>>>>>>>> direction.
Your assumption that I am incorrect prevents >>>>>>>>>>>>>>>>>>>>> you from understanding what I am saying. >>>>>>>>>>>>>>>>>>>>>
failing to acknowledge the invariant ur proof >>>>>>>>>>>>>>>>>>>>>> breaks ain't the right direction polcott >>>>>>>>>>>>>>>>>>>>>>
**Simulation invariant**
**DD simulated by HHH does not reach its own >>>>>>>>>>>>>>>>>>>>> simulated final state.**
which doesn't prove anything about the nature of DD. >>>>>>>>>>>>>>>>>>>> HHH causes the end of DD's simulation, breaking the >>>>>>>>>>>>>>>>>>>> invariant that HHH not do that, as acknowledged by >>>>>>>>>>>>>>>>>>>> sipser as well
what does invariant mean to you polcott? >>>>>>>>>>>>>>>>>>>
simulation has been aborted or we would judge that >>>>>>>>>>>>>>>>>>> all infinite
loops always halt. Instead we look for a repeating >>>>>>>>>>>>>>>>>>> state while the
simulation continues.
that is not a definition of the word "invariant" >>>>>>>>>>>>>>>>>>
and this is just an inductive failure resulting from >>>>>>>>>>>>>>>>>> an overgeneralization fallacy polcott. not only does >>>>>>>>>>>>>>>>>> HHH need to prove that the recursion happens, HHH >>>>>>>>>>>>>>>>>> needs to prove that it continues to happen. one can't >>>>>>>>>>>>>>>>>> just prove the base case in an inductive proof, one >>>>>>>>>>>>>>>>>> needs to prove it for N+1 based on the premise of it >>>>>>>>>>>>>>>>>> for N
I can't help it that this is over you head.
u not proving the inductive case is not over my head >>>>>>>>>>>>>>>>
*This is what induction proves*
There does not exist any implementation of C function HHH >>>>>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>>>>> semantics of C such that the simulated C function DD reaches >>>>>>>>>>>>>>> its own simulated return statement in any N finite number of >>>>>>>>>>>>>>> steps.
and this doesn't prove that DD is a non-terminating >>>>>>>>>>>>>> machine. i can't believe we're still arguing about this >>>>>>>>>>>>>>
If a computable function cannot be reduced to applying >>>>>>>>>>>>> finite string transformations to its finite string inputs >>>>>>>>>>>>> then the computation of this function is outside of the >>>>>>>>>>>>> scope of Turing computable functions in the same way >>>>>>>>>>>>> that filling your tires with air is outside the scope >>>>>>>>>>>>> of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a >>>>>>>>>>>> total halting decider!
As it turns out to actually be this is for the
same reason that your toaster cannot fill your
tires with air.
so ur not actually disagreeing with the halting theorem?
The halting theorem does correctly prove that
your toaster cannot fill your tires with air.
It does not understand that toasters are not
supposed to fill tires with air.
Math requires things that are outside of the
scope of Turing computable functions in the
same way that toasters will not fill your
tires with air.
i don't really get ur disagreement polcott
"math" has proven that no machine can be a total halting
decider, and HHH demonstrates quite well by failing to compute >>>>>>>> DD's correct halting semantics
Right and math can equally prove that no Turing
machine is a plate of spaghetti.
polcott, it's a very reasonable to be concerned about computing/
proving the true halting semantics of any given machine
i'm not sure what ur disagreement is
Math asks for the logically impossible and then
the theory of computing is part of math
blames computation when this request is not fulfilled.
blame??? it's not blame, it's proof based on the idiosyncrasies of
self- referential analysis
The math requirements of a halt decider are outside
the scope of finite string transformation rules
applied to finite string inputs
yes, that is the halting theorem
in the same way as
the requirements that your toaster to fill your
tires with air are outside the scope of toasters.
i can't agree that an automated semantic decider is an absurd thing to
desire
When X is outside of the scope of Y
then an automated semantic decider
that derives results on any basis
than applying finite string transformations
to input finite strings is out of scope
for [Turing equivalent computation] in the
same way as requiring your toaster to fill your
tires with air is out-of-scope for your toaster.
When the request is properly framed as finite
string transformation rules applied to finite
string inputs then this request can be fulfilled.
polcott, HHH(DD) returning 0 does not match the objective halting
semantics of DD, which is that DD halts
HHH(DD)->0 has not fulfilled the request of computing the objective
halting semantics of DD
It has always been a stupid mistake to base the
limits of computation on what math wants instead
of what computation is and how computation works.
but the halting theorem is proven based on how computation >>>>>>>>>> works...
counter-factual
It only seems that way when some of the key details
are ignored by abstracting them away.
My HHH/DD leaves nothing to the imagination than
can be the basis for misconceptions or false
assumptions.
On 11/5/26 5:13 PM, olcott wrote:
On 11/5/2026 6:50 PM, dart200 wrote:
On 11/5/26 1:55 PM, olcott wrote:
On 11/5/2026 3:45 PM, dart200 wrote:
On 11/5/26 1:37 PM, olcott wrote:
On 11/5/2026 3:12 PM, dart200 wrote:
On 11/5/26 1:06 PM, olcott wrote:
On 11/5/2026 2:59 PM, dart200 wrote:
On 11/5/26 12:21 PM, olcott wrote:
On 11/5/2026 2:12 PM, dart200 wrote:
On 11/5/26 11:08 AM, olcott wrote:
On 11/5/2026 1:03 PM, dart200 wrote:
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:u not proving the inductive case is not over my head >>>>>>>>>>>>>>>>>
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>> On 11/4/26 3:10 AM, olcott wrote:
We cannot ever judge halting on the basis of what >>>>>>>>>>>>>>>>>>>> happens afterOn 11/4/2026 12:49 AM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>>> On 11/3/26 3:36 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 5:32 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/26 2:59 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 4:56 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/26 2:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 4:33 PM, Python wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> You write:
idk why u like wasting so much time on running in >>>>>>>>>>>>>>>>>>>>>>> circles with the rest of them. they don't even >>>>>>>>>>>>>>>>>>>>>>> think something is broken, i do
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way >>>>>>>>>>>>>>>>>>>>>>>>>>>>> consensus" whenever someone challenges YOUR >>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusions.
You can look at the record on news.giganews.com >>>>>>>>>>>>>>>>>>>>>>>>>>>> where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>>>>>>>>>>>>>> one from comp.theory has every agreed with >>>>>>>>>>>>>>>>>>>>>>>>>>>> anythingr
like this until last Sunday: >>>>>>>>>>>>>>>>>>>>>>>>>>>>
There does not exist any implementation of C >>>>>>>>>>>>>>>>>>>>>>>>>>>> function HHH
that simulates C function DD according to >>>>>>>>>>>>>>>>>>>>>>>>>>>> the operational
semantics of C such that the simulated C >>>>>>>>>>>>>>>>>>>>>>>>>>>> function DD reaches
its own simulated return statement in any N >>>>>>>>>>>>>>>>>>>>>>>>>>>> finite number of
steps.
idk why u keep repeatedly confirming the >>>>>>>>>>>>>>>>>>>>>>>>>>> halting theorum, HHH cannot accurately decide >>>>>>>>>>>>>>>>>>>>>>>>>>> on DD Efn+
You keep jumping ahead five steps before >>>>>>>>>>>>>>>>>>>>>>>>>> I establish my basis.
there's no basis here polcott >>>>>>>>>>>>>>>>>>>>>>>>>
OK I am done talking to you for a while. >>>>>>>>>>>>>>>>>>>>>>>
i'm just trying to get u focused in the right >>>>>>>>>>>>>>>>>>>>>>> direction.
Your assumption that I am incorrect prevents >>>>>>>>>>>>>>>>>>>>>> you from understanding what I am saying. >>>>>>>>>>>>>>>>>>>>>>
failing to acknowledge the invariant ur proof >>>>>>>>>>>>>>>>>>>>>>> breaks ain't the right direction polcott >>>>>>>>>>>>>>>>>>>>>>>
**Simulation invariant**
**DD simulated by HHH does not reach its own >>>>>>>>>>>>>>>>>>>>>> simulated final state.**
which doesn't prove anything about the nature of >>>>>>>>>>>>>>>>>>>>> DD. HHH causes the end of DD's simulation, breaking >>>>>>>>>>>>>>>>>>>>> the invariant that HHH not do that, as acknowledged >>>>>>>>>>>>>>>>>>>>> by sipser as well
what does invariant mean to you polcott? >>>>>>>>>>>>>>>>>>>>
simulation has been aborted or we would judge that >>>>>>>>>>>>>>>>>>>> all infinite
loops always halt. Instead we look for a repeating >>>>>>>>>>>>>>>>>>>> state while the
simulation continues.
that is not a definition of the word "invariant" >>>>>>>>>>>>>>>>>>>
and this is just an inductive failure resulting from >>>>>>>>>>>>>>>>>>> an overgeneralization fallacy polcott. not only does >>>>>>>>>>>>>>>>>>> HHH need to prove that the recursion happens, HHH >>>>>>>>>>>>>>>>>>> needs to prove that it continues to happen. one can't >>>>>>>>>>>>>>>>>>> just prove the base case in an inductive proof, one >>>>>>>>>>>>>>>>>>> needs to prove it for N+1 based on the premise of it >>>>>>>>>>>>>>>>>>> for N
I can't help it that this is over you head. >>>>>>>>>>>>>>>>>
*This is what induction proves*
There does not exist any implementation of C function HHH >>>>>>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>>>>>> semantics of C such that the simulated C function DD >>>>>>>>>>>>>>>> reaches
its own simulated return statement in any N finite >>>>>>>>>>>>>>>> number of
steps.
and this doesn't prove that DD is a non-terminating >>>>>>>>>>>>>>> machine. i can't believe we're still arguing about this >>>>>>>>>>>>>>>
If a computable function cannot be reduced to applying >>>>>>>>>>>>>> finite string transformations to its finite string inputs >>>>>>>>>>>>>> then the computation of this function is outside of the >>>>>>>>>>>>>> scope of Turing computable functions in the same way >>>>>>>>>>>>>> that filling your tires with air is outside the scope >>>>>>>>>>>>>> of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a >>>>>>>>>>>>> total halting decider!
As it turns out to actually be this is for the
same reason that your toaster cannot fill your
tires with air.
so ur not actually disagreeing with the halting theorem? >>>>>>>>>>>
The halting theorem does correctly prove that
your toaster cannot fill your tires with air.
It does not understand that toasters are not
supposed to fill tires with air.
Math requires things that are outside of the
scope of Turing computable functions in the
same way that toasters will not fill your
tires with air.
i don't really get ur disagreement polcott
"math" has proven that no machine can be a total halting
decider, and HHH demonstrates quite well by failing to compute >>>>>>>>> DD's correct halting semantics
Right and math can equally prove that no Turing
machine is a plate of spaghetti.
polcott, it's a very reasonable to be concerned about computing/ >>>>>>> proving the true halting semantics of any given machine
i'm not sure what ur disagreement is
Math asks for the logically impossible and then
the theory of computing is part of math
blames computation when this request is not fulfilled.
blame??? it's not blame, it's proof based on the idiosyncrasies of
self- referential analysis
The math requirements of a halt decider are outside
the scope of finite string transformation rules
applied to finite string inputs
yes, that is the halting theorem
in the same way as
the requirements that your toaster to fill your
tires with air are outside the scope of toasters.
i can't agree that an automated semantic decider is an absurd thing
to desire
When X is outside of the scope of Y
then an automated semantic decider
that derives results on any basis
than applying finite string transformations
to input finite strings is out of scope
for [Turing equivalent computation] in the
same way as requiring your toaster to fill your
tires with air is out-of-scope for your toaster.
or in other words: u agree with the halting theorem Efai
On 11/5/2026 7:15 PM, dart200 wrote:
On 11/5/26 5:13 PM, olcott wrote:
On 11/5/2026 6:50 PM, dart200 wrote:
On 11/5/26 1:55 PM, olcott wrote:
On 11/5/2026 3:45 PM, dart200 wrote:
On 11/5/26 1:37 PM, olcott wrote:
On 11/5/2026 3:12 PM, dart200 wrote:
On 11/5/26 1:06 PM, olcott wrote:
On 11/5/2026 2:59 PM, dart200 wrote:
On 11/5/26 12:21 PM, olcott wrote:
On 11/5/2026 2:12 PM, dart200 wrote:
On 11/5/26 11:08 AM, olcott wrote:
On 11/5/2026 1:03 PM, dart200 wrote:
On 11/5/26 9:57 AM, olcott wrote:
On 11/5/2026 11:06 AM, dart200 wrote:
On 11/5/26 8:32 AM, olcott wrote:
On 11/5/2026 10:20 AM, dart200 wrote:
On 11/5/26 3:55 AM, olcott wrote:
On 11/5/2026 12:50 AM, dart200 wrote:u not proving the inductive case is not over my head >>>>>>>>>>>>>>>>>>
On 11/4/26 9:39 AM, olcott wrote:
On 11/4/2026 11:33 AM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>> On 11/4/26 3:10 AM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>> On 11/4/2026 12:49 AM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 11/3/26 3:36 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 5:32 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/26 2:59 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 4:56 PM, dart200 wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/26 2:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 11/3/2026 4:33 PM, Python wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You write:
We cannot ever judge halting on the basis of what >>>>>>>>>>>>>>>>>>>>> happens afteridk why u like wasting so much time on running >>>>>>>>>>>>>>>>>>>>>>>> in circles with the rest of them. they don't >>>>>>>>>>>>>>>>>>>>>>>> even think something is broken, i do >>>>>>>>>>>>>>>>>>>>>>>>
-a-a-a "Of course. I have never said otherwise." >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
BULLSHIT.
You repeatedly invoke your "five-way >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> consensus" whenever someone challenges >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> YOUR conclusions.
You can look at the record on >>>>>>>>>>>>>>>>>>>>>>>>>>>>> news.giganews.com
where my posts go back to 2004 and see that no >>>>>>>>>>>>>>>>>>>>>>>>>>>>> one from comp.theory has every agreed with >>>>>>>>>>>>>>>>>>>>>>>>>>>>> anythingr
like this until last Sunday: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>
There does not exist any implementation of >>>>>>>>>>>>>>>>>>>>>>>>>>>>> C function HHH
that simulates C function DD according to >>>>>>>>>>>>>>>>>>>>>>>>>>>>> the operational
semantics of C such that the simulated C >>>>>>>>>>>>>>>>>>>>>>>>>>>>> function DD reaches
its own simulated return statement in any N >>>>>>>>>>>>>>>>>>>>>>>>>>>>> finite number of
steps.
idk why u keep repeatedly confirming the >>>>>>>>>>>>>>>>>>>>>>>>>>>> halting theorum, HHH cannot accurately >>>>>>>>>>>>>>>>>>>>>>>>>>>> decide on DD Efn+
You keep jumping ahead five steps before >>>>>>>>>>>>>>>>>>>>>>>>>>> I establish my basis.
there's no basis here polcott >>>>>>>>>>>>>>>>>>>>>>>>>>
OK I am done talking to you for a while. >>>>>>>>>>>>>>>>>>>>>>>>
i'm just trying to get u focused in the right >>>>>>>>>>>>>>>>>>>>>>>> direction.
Your assumption that I am incorrect prevents >>>>>>>>>>>>>>>>>>>>>>> you from understanding what I am saying. >>>>>>>>>>>>>>>>>>>>>>>
failing to acknowledge the invariant ur proof >>>>>>>>>>>>>>>>>>>>>>>> breaks ain't the right direction polcott >>>>>>>>>>>>>>>>>>>>>>>>
**Simulation invariant**
**DD simulated by HHH does not reach its own >>>>>>>>>>>>>>>>>>>>>>> simulated final state.**
which doesn't prove anything about the nature of >>>>>>>>>>>>>>>>>>>>>> DD. HHH causes the end of DD's simulation, >>>>>>>>>>>>>>>>>>>>>> breaking the invariant that HHH not do that, as >>>>>>>>>>>>>>>>>>>>>> acknowledged by sipser as well
what does invariant mean to you polcott? >>>>>>>>>>>>>>>>>>>>>
simulation has been aborted or we would judge that >>>>>>>>>>>>>>>>>>>>> all infinite
loops always halt. Instead we look for a repeating >>>>>>>>>>>>>>>>>>>>> state while the
simulation continues.
that is not a definition of the word "invariant" >>>>>>>>>>>>>>>>>>>>
and this is just an inductive failure resulting from >>>>>>>>>>>>>>>>>>>> an overgeneralization fallacy polcott. not only does >>>>>>>>>>>>>>>>>>>> HHH need to prove that the recursion happens, HHH >>>>>>>>>>>>>>>>>>>> needs to prove that it continues to happen. one >>>>>>>>>>>>>>>>>>>> can't just prove the base case in an inductive >>>>>>>>>>>>>>>>>>>> proof, one needs to prove it for N+1 based on the >>>>>>>>>>>>>>>>>>>> premise of it for N
I can't help it that this is over you head. >>>>>>>>>>>>>>>>>>
*This is what induction proves*
There does not exist any implementation of C function HHH >>>>>>>>>>>>>>>>> that simulates C function DD according to the operational >>>>>>>>>>>>>>>>> semantics of C such that the simulated C function DD >>>>>>>>>>>>>>>>> reaches
its own simulated return statement in any N finite >>>>>>>>>>>>>>>>> number of
steps.
and this doesn't prove that DD is a non-terminating >>>>>>>>>>>>>>>> machine. i can't believe we're still arguing about this >>>>>>>>>>>>>>>>
If a computable function cannot be reduced to applying >>>>>>>>>>>>>>> finite string transformations to its finite string inputs >>>>>>>>>>>>>>> then the computation of this function is outside of the >>>>>>>>>>>>>>> scope of Turing computable functions in the same way >>>>>>>>>>>>>>> that filling your tires with air is outside the scope >>>>>>>>>>>>>>> of your toaster.
The behavior of int main(){ DD(); }
cannot be possibly be specified as an input
finite string HHH(DD)
yes polcott, the halting theorem says u cannot define a >>>>>>>>>>>>>> total halting decider!
As it turns out to actually be this is for the
same reason that your toaster cannot fill your
tires with air.
so ur not actually disagreeing with the halting theorem? >>>>>>>>>>>>
The halting theorem does correctly prove that
your toaster cannot fill your tires with air.
It does not understand that toasters are not
supposed to fill tires with air.
Math requires things that are outside of the
scope of Turing computable functions in the
same way that toasters will not fill your
tires with air.
i don't really get ur disagreement polcott
"math" has proven that no machine can be a total halting
decider, and HHH demonstrates quite well by failing to compute >>>>>>>>>> DD's correct halting semantics
Right and math can equally prove that no Turing
machine is a plate of spaghetti.
polcott, it's a very reasonable to be concerned about computing/ >>>>>>>> proving the true halting semantics of any given machine
i'm not sure what ur disagreement is
Math asks for the logically impossible and then
the theory of computing is part of math
blames computation when this request is not fulfilled.
blame??? it's not blame, it's proof based on the idiosyncrasies of >>>>>> self- referential analysis
The math requirements of a halt decider are outside
the scope of finite string transformation rules
applied to finite string inputs
yes, that is the halting theorem
in the same way as
the requirements that your toaster to fill your
tires with air are outside the scope of toasters.
i can't agree that an automated semantic decider is an absurd thing
to desire
When X is outside of the scope of Y
then an automated semantic decider
that derives results on any basis
than applying finite string transformations
to input finite strings is out of scope
for [Turing equivalent computation] in the
same way as requiring your toaster to fill your
tires with air is out-of-scope for your toaster.
or in other words: u agree with the halting theorem Efai
That a halt decider can't bake an actual real
angel food cake using mathematical abstractions
as its only ingredient is also a fundamental
limit of reality.
On 11/3/2026 5:13 PM, Andr|- G. Isaak wrote:
On 2026-11-03 12:50, olcott wrote:
On 11/2/2026 8:50 AM, Python wrote:
WHILE THE SIMULATION CONTINUES,
DD DOES NOT REACH ITS RETURN.
Yes. *While* the simulation continues, DD does not reach its return
instruction. That's because your HHH stops simulating (aborts) before
DD reaches its return instruction;
*A five-way consensus disagrees*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
*Thus you are a liar at this point*
Add your agreement making this a 6-way consensus
or I won't talk to you again.
On 2026-11-05 11:58, olcott wrote:
On 11/3/2026 5:13 PM, Andr|- G. Isaak wrote:
On 2026-11-03 12:50, olcott wrote:
On 11/2/2026 8:50 AM, Python wrote:
WHILE THE SIMULATION CONTINUES,
DD DOES NOT REACH ITS RETURN.
Yes. *While* the simulation continues, DD does not reach its return
instruction. That's because your HHH stops simulating (aborts) before
DD reaches its return instruction;
*A five-way consensus disagrees*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
AFAICT, your "five-way consensus" does not disagree with what I claim
above, but rather agrees with a very narrow claim which you have made
and which you have then misconstrued to count as agreement with a much stronger claim.
*Thus you are a liar at this point*
Add your agreement making this a 6-way consensus
or I won't talk to you again.
I can't simply agree with a statement which I have reservations about
just because you demand it (or because some other people may have agreed
to it). And given your propensity to misinterpret exactly what people
have said I have an understandable reluctance to agree with you on any
point that isn't well-formalized.
If you want to stop talking to me, that's no skin off my back. You have largely ignored my actual substantive points anyways.
Also, why are you repeating a response verbatim from a post from a day
or two ago? There's really no need to post material more than once.
Andr|-
| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 76 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 58:10:03 |
| Calls: | 1,265 |
| Calls today: | 1 |
| Files: | 1,362 |
| D/L today: |
4 files (9,632K bytes) |
| Messages: | 285,955 |