Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.theory > #25230

Re: Refuting the halting problem proofs by deciding the previously undecidable input (V6)

From Ben Bacarisse <ben.usenet@bsb.me.uk>
Newsgroups comp.theory
Subject Re: Refuting the halting problem proofs by deciding the previously undecidable input (V6)
Date 2020-11-13 15:51 +0000
Organization A noiseless patient Spider
Message-ID <87y2j5ntk1.fsf@bsb.me.uk> (permalink)
References <PfWdnRj2I66BBTPCnZ2dnUU7-fXNnZ2d@giganews.com>

Show all headers | View raw


olcott <NoOne@NoWhere.com> writes:

> When-so-ever UTM halt decider H decides that:
> (1) its input (<P>,I) would never halt unless H stopped simulating it
>    and
> (2) its input (<P>,I) would never halt unless H stopped simulating it
> then H has made a correct not-halting decision on this input.
>
> Since it does divide all of its inputs into {halting and not-halting}
> it is a halt decider.

No, that is not what the halting problem is about.

-- 
Ben.

Back to comp.theory | Previous | Next — Previous in thread | Find similar | Unroll thread


Thread

Refuting the halting problem proofs by deciding the previously undecidable input (V6) olcott <NoOne@NoWhere.com> - 2020-11-13 08:28 -0600
  Re: Refuting the halting problem proofs by deciding the previously undecidable input (V6) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-13 15:08 +0000
    Re: Refuting the halting problem proofs by deciding the previously undecidable input (V6) olcott <NoOne@NoWhere.com> - 2020-11-13 09:23 -0600
  Re: Refuting the halting problem proofs by deciding the previously undecidable input (V6) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-13 15:51 +0000

csiph-web