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.
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/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/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/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/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/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/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/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/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/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.
| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 76 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 56:23:36 |
| Calls: | 1,265 |
| Calls today: | 1 |
| Files: | 1,362 |
| D/L today: |
3 files (2,684K bytes) |
| Messages: | 285,806 |