Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Newsgroups | comp.theory |
| Subject | Re: Halting theorem refutation (Three irrefutable truisms lead to one conclusion) |
| Date | 2021-05-20 12:35 +0100 |
| Organization | A noiseless patient Spider |
| Message-ID | <87lf89vdso.fsf@bsb.me.uk> (permalink) |
| References | <Fr2dnaHj2JTVTjj9nZ2dnUU7-RPNnZ2d@giganews.com> |
olcott <NoOne@NoWhere.com> writes:
> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞
> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn
>
> The above is adapted from (Linz:1990:319).
> It shows that Turing machine Ĥ copies its input at (q0) and begins
> executing an embedded copy of the original halt decider with this
> input at (qx).
>
> The (qy) state indicates that the halt decider decides that its input
> would halt. The ((qn)) state indicates the input would not halt.
The only qy and qn you show are in H^. They do not indicate what you
say. They can't since qy is not even a final state! You need to learn
what a decider is and you need to learn what a Turing machine is.
> *Three irrefutable truisms lead to one conclusion*
>
> Truism(1a)
> The simulation of [Ĥ] by its simulating halt decider Ĥ would never
> halt unless this simulation is aborted.
Ĥ is not a halt decider. It is not even a partial halt decider. Years
down the line and you can't even write a simple sentence using core
technical terms correctly.
There is no need to mis-use the name H^. There is no need (other than
to prime linguistic trick you plan to pull later) to use silly terms
like "its", and if you must use operational language, computation "do".
There is no point in saying what they would do if there were not the
computation that they are.
Here are the facts that I think you are deliberately trying to make
obscure by misusing names and terms:
(a) UTM^([UTM^]) is not a finite computation. The "hat" construction
means that a pure simulator will not halt on it's "hat" version.
(b) Your partial decider D is a UTM that also scans for the
silly-non-halting pattern.
(c) D^([D^]) is a finite computation.
(d) D(<[D^], [D^]>) gives the wrong result for the halting problem but,
according to you, the correct result or the silly-non-halting
problem.
Now, do you agree with these facts? An actual answer would be appreciated.
> Truism(1b)
> (1a) is another way of saying that when the copy of H at Ĥ.qx only
> simulates its input [Ĥ] its input never halts.
Just say that UTM^([UTM^]) is not a finite computation. No need to
abuse the name H to refer to a UTM as well.
> Truism(2)
> Every simulation of input P that would never halt unless simulating
> halt decider H stopped simulating it <is> a non-halting
> computation. This remains true even after H stops simulating P.
Try writing this is English. Better yet, try writing it formally.
A halting problem instance, P, is a non-halting computation if the
sequence of configurations it defines is not finite.
Any statement about what "remains true" when something changes is just
part of your plan to define the silly-non-halting result for one
computation as the halting status of another.
> Truism(3)
> Ĥ([Ĥ]) Halts because it aborted the simulation of its input.
Much better to call it D and say that D^([D^]) halts.
> Conclusion:
> Ĥ is a halting computation
No. So many years down the line and you still don't even know what a
computation is.
> and its input is not a halting computation
You show no input. Any string can be presented to any TM so "its input"
is just meaningless.
> therefore Ĥ decides its input [Ĥ] as non-halting correctly.
[H^] is not a computation. It is neither halting nor non halting.
The actual facts of the matter:
(a) UTM^([UTM^]) is not a finite computation. The "hat" construction
means that a pure simulator will not halt on it's "hat" version.
(b) Your partial decider D is a UTM that also scans for the
silly-non-halting pattern.
(c) D^([D^]) is a finite computation.
(d) D(<[D^], [D^]>) gives the wrong result for the halting problem but,
according to you, the correct result or the silly-non-halting
problem.
--
Ben.
Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Halting theorem refutation (Three irrefutable truisms lead to one conclusion) olcott <NoOne@NoWhere.com> - 2021-05-19 22:11 -0500
Re: Halting theorem refutation (Three irrefutable truisms lead to one conclusion) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-20 06:16 +0000
Re: Halting theorem refutation (Three irrefutable truisms lead to one conclusion)(not a typo) olcott <NoOne@NoWhere.com> - 2021-05-20 10:53 -0500
Re: Halting theorem refutation (Three irrefutable truisms lead to one conclusion) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-20 12:35 +0100
Re: Halting theorem refutation (Three irrefutable truisms lead to one conclusion)(pause until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-20 10:04 -0500
Re: Halting theorem refutation (Three irrefutable truisms lead to one conclusion)(pause until mutual agreement) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-21 00:44 +0100
Re: Halting theorem refutation (Three irrefutable truisms lead to one conclusion)(pause until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-20 19:08 -0500
Re: Halting theorem refutation (Three irrefutable truisms lead to one conclusion)(pause until mutual agreement) Richard Damon <Richard@Damon-Family.org> - 2021-05-21 07:42 -0400
Re: Halting theorem refutation (Three irrefutable truisms lead to one conclusion)(pause until mutual agreement) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-21 23:49 +0100
csiph-web