On 3/22/22 10:53 AM, olcott wrote:
On 3/22/2022 9:39 AM, Ben Bacarisse wrote:
olcott <NoOne@NoWhere.com> writes:
Yet you cannot point out a single error in my halting problem
refutation.
The mistakes have been pointed out so many times that it's reasonable to >>> assume you can't see them or are simply ignoring them. The latest
monster error is that if (as you claim) this is true of your Ĥ:
"Ĥ.qx maps ⟨Ĥ⟩ ⟨Ĥ⟩ to Ĥ.qn"
but
"H maps ⟨Ĥ⟩ ⟨Ĥ⟩ to H.qy"
then Ĥ is not even a Truing machine, let alone the specific Ĥ in Linz's >>> proof.
If the halt deciding criteria compares the finite strings of Turing
machine descriptions as its halt deciding basis then it will find that
H and the copy of H embedded at Ĥ.qx are not the identical (embedded_H
is a longer finite string) thus providing the basis for H to see that
embedded_H will transition to Ĥ.qn and halt.
Except that inside embedded_H IS an exact copy of H, which should match
the 'string compare' if you could possible built it.
Since H doesn't have a unique, or even a finite number of
representations, it makes it hard to try to 'string compare' to find
copies.
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 365 |
Nodes: | 16 (2 / 14) |
Uptime: | 25:28:25 |
Calls: | 7,769 |
Files: | 12,905 |
Messages: | 5,749,281 |