Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
Re: Why halt deciders can't be "interesting" programs. (HP refutation) Is Ben Bluffing?
22 views
Skip to first unread message
olcott
Sep 17, 2020, 8:41:54 PM9/17/20
to
On 9/17/2020 1:57 PM, Ben Bacarisse wrote:
> olcott <No...@NoWhere.com> writes:
>
>> The x86 based UTM equivalent executes H and Ĥ as UTM equivalents
>> eliminating the need for the tedious dichotomy of a machine M and its
>> description w.
>
> Ding! Ding! Ding! We have a winner! We now know what the scam you
> planned on pulling is. Shame on you. Don't bother to post any code.
> You have tipped your hand at last.
>
I see three possibilities:
(1) You are just bluffing (that would be dishonest).
(2) You did not figure out my method but believe that you did.
(3) You did figure out my method yet it did not fully sink in that this
method really does refute the halting problem proofs because your mind
is hard-wired to denial mode.
--
Copyright 2020 Pete Olcott
> olcott <No...@NoWhere.com> writes:
>
>> The x86 based UTM equivalent executes H and Ĥ as UTM equivalents
>> eliminating the need for the tedious dichotomy of a machine M and its
>> description w.
>
> Ding! Ding! Ding! We have a winner! We now know what the scam you
> planned on pulling is. Shame on you. Don't bother to post any code.
> You have tipped your hand at last.
>
I see three possibilities:
(1) You are just bluffing (that would be dishonest).
(2) You did not figure out my method but believe that you did.
(3) You did figure out my method yet it did not fully sink in that this
method really does refute the halting problem proofs because your mind
is hard-wired to denial mode.
--
Copyright 2020 Pete Olcott
ijw wij
Sep 18, 2020, 3:40:23 AM9/18/20
to
olcott 在 2020年9月18日 星期五上午8:41:54 [UTC+8] 的信中寫道：
I'm interested in the 'halt deciders programs'. Suppose two TM's, one
is computing and printing 1/3=0.333... another is pi=3.1415...
Will the decoder halt? So I can investigate the reason?
is computing and printing 1/3=0.333... another is pi=3.1415...
Will the decoder halt? So I can investigate the reason?
ijw wij
Sep 18, 2020, 3:49:09 AM9/18/20
to
ijw wij 在 2020年9月18日 星期五下午3:40:23 [UTC+8] 的信中寫道：
Will the decoder terminate? So I can investigate the reason?
Juha Nieminen
Sep 18, 2020, 9:43:13 AM9/18/20
to
ijw wij <wyn...@gmail.com> wrote:
> I'm interested in the 'halt deciders programs'. Suppose two TM's, one
> is computing and printing 1/3=0.333... another is pi=3.1415...
> Will the decoder halt? So I can investigate the reason?
Usually when talking about the halting program, the problem is if there's
> I'm interested in the 'halt deciders programs'. Suppose two TM's, one
> is computing and printing 1/3=0.333... another is pi=3.1415...
> Will the decoder halt? So I can investigate the reason?
a way to tell from a given program whether it will ever terminate or not.
I suppose the same can be applied to merely an algorithm description or
task description.
If the task is: "Compute and print all the decimals of 1/3", then it's
rather obvious that it will not halt. If the program has been implemented
correctly, it will never halt.
The problem is whether it's possible to create a program or algorithm
that tells you from any given other program whether it will eventually
halt or continue forever.
And this has nothing to do with debugging.
olcott
Sep 18, 2020, 1:58:22 PM9/18/20
to
will see the very first line-of-code indicating non halting behavior.
0 new messages