olcott <NoOne@NoWhere.com> writes:
Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ never halts [UNLESS] it aborts its simulation,
not very hard at all for people that care about truth as opposed to
and contrast with winning an argument.
(correction added from your own follow-up)
Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ halts. It halts in rejecting state Ĥ.qn. There
is no dispute about this fact from you or anyone else. The /reason/ it
halts is interesting to you, but /not/ to anyone else.
The facts remain: ⟨Ĥ⟩ ⟨Ĥ⟩ encodes a halting computation and you were
flat-out wrong to say that is does not. And H (the machine embedded in
Ĥ at Ĥ.qx) is wrong to reject the string for that reason. You will
never admit either mistake.
That you are wrong is so blinding obvious that any paper you write about
the theorem will go in the editor's bin in seconds. (Unless he or she decides it's worth pinning on the staff room notice board for fun.)
On Thursday, 2 September 2021 at 00:06:40 UTC+1, richar...@gmail.com wrote:
On 9/1/21 9:27 AM, olcott wrote:It makes it easier to get confused.
On 9/1/2021 4:19 AM, Malcolm McLean wrote:So?
On Wednesday, 1 September 2021 at 05:33:09 UTC+1, olcott wrote:
I suggested this a long time ago. The halt issued by the copy of H
For the moment let's just hypothesize that my "theorem" is true and that >>>>> it has been agreed that int main() { P(P); } never halts unless H(P,P) >>>>> aborts its input. Then we can conclude that the input to H(P,P) never >>>>> halts.
embedded
in P is considered special. That idea was rejected.
There is a single master instance of H that allocates all of its tape to >>> its slave instances.
If it doesn't create proper 'virtual' copies of the machines and
simulate them accurately it doesn't prove anything.
With the Linz set up, there is a near copy of H on the tape, but it is separate
code. H is a physical machine (or more likely an electronic emulation).
With PO's set up, we have C routines. And the same physical copy of H
is called (not emulated, which is surprising and we still haven't got to
the bottom of that).
So when you say "the program under test was halted by H" it's not clear exactly what you are talking about.
It's common ground that H_Hat<H_Hat> halts, and H<H_Hat><H_Hat>
The fact that simulated copies of H(H^,^) are apparently non-halting
means that something is broken, either H is inaccurate in its simulating
or H isn't a Computation, and thus can't be a decider.
returns false (non-halting). But the claim is that H is nevertheless correct.
I've suggested to PO that maybe that's because the halts issued by the copy of H in H_Hat are "special". But he hasn't agreed with that. He writes
[PO}
So this begs the question.When we examine the x86 execution trace of the simulation of the input
to H(P,P) we can determine that unless H aborts its simulation that its
input never halts.
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 295 |
Nodes: | 16 (2 / 14) |
Uptime: | 02:00:27 |
Calls: | 6,642 |
Calls today: | 2 |
Files: | 12,190 |
Messages: | 5,325,482 |