Can D simulated by H terminate normally?
-
When the original proof relies on a single counter-example template as its input to prove undecidability all that is needed to refute this proof is to show how to determine the halt status of this otherwise undecidable input. Anyone with a BSCS can easily verify the software engineering aspect of my work. D correctly simulated by H remains stuck in recursive simulation, thus cannot possibly terminate normally. Once this is understood and accepted then looking at my actual code for H shows that it does correctly recognize a non-halting behavior pattern having the same form as infinite recursion. Summing this all up although there is a universal consensus of subjective opinion that I am wrong the objectively verified facts conclusively prove that my software engineering is correct.
Try submitting it here for more peer review. Frontiers | Publisher of peer-reviewed articles in open access journals[^]
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
polcott wrote:
cannot possibly terminate normally.
Nigel Molesworth* wrote:
As any fule kno.
*The curse of St. Custard's
And examining the complete github code of H posted on a link in these messages we can see that H itself correctly determines that D correctly simulated by H cannot possibly terminate normally. H simply recognizes a dynamic behavior pattern having the same form as infinite recursion. For any program H that might determine whether programs halt, a "pathological" program D, called with some input, can pass its own source and its input to H and then specifically do the opposite of what H predicts D will do. No H can exist that handles this case. Wikipedia: Halting Problem Finally we can also see (From the above Wikipedia quote) that H and D have the exact halting problem relationship to each other. Thus it is clear from a software engineering perspective that H does correctly determine the halt status of the halting problem's "impossible" input. If I was actually wrong someone could point out a mistake.
-
Try submitting it here for more peer review. Frontiers | Publisher of peer-reviewed articles in open access journals[^]
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
I am aware that there are journals that accept any material if you pay them enough. My aim is Communications of the ACM, where Edgar Dijkstra got his start. Edgar Dijkstra: Go To Statement Considered Harmful
-
I am aware that there are journals that accept any material if you pay them enough. My aim is Communications of the ACM, where Edgar Dijkstra got his start. Edgar Dijkstra: Go To Statement Considered Harmful
OK, then how about starting here. Author Guidelines | Communications of the ACM[^]
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
And examining the complete github code of H posted on a link in these messages we can see that H itself correctly determines that D correctly simulated by H cannot possibly terminate normally. H simply recognizes a dynamic behavior pattern having the same form as infinite recursion. For any program H that might determine whether programs halt, a "pathological" program D, called with some input, can pass its own source and its input to H and then specifically do the opposite of what H predicts D will do. No H can exist that handles this case. Wikipedia: Halting Problem Finally we can also see (From the above Wikipedia quote) that H and D have the exact halting problem relationship to each other. Thus it is clear from a software engineering perspective that H does correctly determine the halt status of the halting problem's "impossible" input. If I was actually wrong someone could point out a mistake.
polcott wrote:
If I was actually wrong someone could point out a mistake.
I can't speak for anyone else but I am certainly not going to attempt to teach you an entire class on Turing Machine mathematics. And I already suggested that you take exactly that sort of class. I found one that teaches it. I know there are others. Models of Computation[^]
-
OK, then how about starting here. Author Guidelines | Communications of the ACM[^]
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
I spoke very extensively with Moshe Y. Vardi the former editor in chief of the CACM about two dozen emails altogether. Back then I could only prove my point though an x86 machine language execution trace. He did not know the x86 language at all so I made zero progress. The only huge success that I had was with: MIT Professor Michael Sipser has agreed that the following verbatim paragraph is correct: If simulating halt decider H correctly simulates its input D until H correctly determines that its simulated D would never stop running unless aborted then H can abort its simulation of D and correctly report that D specifies a non-halting sequence of configurations. He also agreed that I can quote him on this. It is only the above paragraph that he has agreed to.
-
I spoke very extensively with Moshe Y. Vardi the former editor in chief of the CACM about two dozen emails altogether. Back then I could only prove my point though an x86 machine language execution trace. He did not know the x86 language at all so I made zero progress. The only huge success that I had was with: MIT Professor Michael Sipser has agreed that the following verbatim paragraph is correct: If simulating halt decider H correctly simulates its input D until H correctly determines that its simulated D would never stop running unless aborted then H can abort its simulation of D and correctly report that D specifies a non-halting sequence of configurations. He also agreed that I can quote him on this. It is only the above paragraph that he has agreed to.
Quote:
Moshe Y. Vardi the former editor in chief of the CACM
How about now, armed with your quote?
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
Quote:
Moshe Y. Vardi the former editor in chief of the CACM
How about now, armed with your quote?
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
He has already made up his mind and closed it. I really shouldn't even need that quote. Anyone with at least a BSCS can verify that it is necessarily true. The technical term for a statement that is necessarily true is tautology.
polcott wrote:
He has already made up his mind
Who's 'he', the current editor? Look, if your stated aim to publish there (CAMC), then concentrate your efforts there. It doesn't seem as though 'here' is getting you anywhere.
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
polcott wrote:
He has already made up his mind
Who's 'he', the current editor? Look, if your stated aim to publish there (CAMC), then concentrate your efforts there. It doesn't seem as though 'here' is getting you anywhere.
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
I generally get the same response that I am getting here. Everyone is so sure that I must be wrong that they don't bother to look at a single word that I have said and simply vote me down until the post is deleted. Any BSCS graduate taking five minutes to examine my code can see that D correctly simulated by H cannot possibly terminate normally because it remains stuck in recursive simulation. That by itself should be enough to pique their interest in looking at the additional details. Because my writing style is not even close the the writing style of a published PhD researcher what I say is almost always rejected out-of-hand without review of the substance of what I have said.
-
I generally get the same response that I am getting here. Everyone is so sure that I must be wrong that they don't bother to look at a single word that I have said and simply vote me down until the post is deleted. Any BSCS graduate taking five minutes to examine my code can see that D correctly simulated by H cannot possibly terminate normally because it remains stuck in recursive simulation. That by itself should be enough to pique their interest in looking at the additional details. Because my writing style is not even close the the writing style of a published PhD researcher what I say is almost always rejected out-of-hand without review of the substance of what I have said.
polcott wrote:
Because my writing style is not even close the the writing style of a published PhD researcher what I say is almost always rejected out-of-hand without review of the substance of what I have said.
For some reason I doubt that. What would happen if everyone here agreed with your conclusion?
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
polcott wrote:
Because my writing style is not even close the the writing style of a published PhD researcher what I say is almost always rejected out-of-hand without review of the substance of what I have said.
For some reason I doubt that. What would happen if everyone here agreed with your conclusion?
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
If everyone here agreed that page three of this paper is correct and they sincerely meant this, then I would know that I have finally made my point clear enough and I would submit page three to letters to the editor of CACM. Simulating (partial) Halt Deciders Defeat the Halting Problem Proofs I might have to come up with a much less controversial title such as: Simple Termination analysis between executing C functions.
-
If everyone here agreed that page three of this paper is correct and they sincerely meant this, then I would know that I have finally made my point clear enough and I would submit page three to letters to the editor of CACM. Simulating (partial) Halt Deciders Defeat the Halting Problem Proofs I might have to come up with a much less controversial title such as: Simple Termination analysis between executing C functions.
polcott wrote:
If everyone here agreed that page three of this paper is correct
Probably not going to happen here, so just cut to the chase. Change the title and submit, possibly adding that professors name somehow in the title.
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
polcott wrote:
If everyone here agreed that page three of this paper is correct
Probably not going to happen here, so just cut to the chase. Change the title and submit, possibly adding that professors name somehow in the title.
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
In other words you too are not going to bother to take five minutes and verify that D correctly simulated by H cannot possibly terminate normally because it remains stuck in recursive simulation.
You are correct.
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
You are correct.
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
The objective facts prove that I am correct thus superseding all opinions to the contrary. I really hope that you don't feel this same way about climate change.
I claimed nothing about your conclusions one way or another.
polcott wrote:
The objective facts prove that I am correct thus superseding all opinions to the contrary.
Where has that got you?
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
I claimed nothing about your conclusions one way or another.
polcott wrote:
The objective facts prove that I am correct thus superseding all opinions to the contrary.
Where has that got you?
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
You can't force people to care, that's the truth.
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
You can't force people to care, that's the truth.
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle