Re: Simulating halt deciders (SHDs) simply do not work; alas neither does Olcott.

From	Mr Flibble <flibble@reddwarf.jmc.corp>
Newsgroups	comp.theory, sci.logic, comp.ai.philosophy, comp.lang.c++, comp.lang+c
Subject	Re: Simulating halt deciders (SHDs) simply do not work; alas neither does Olcott.
Message-ID	<20221023161856.0000404a@reddwarf.jmc.corp> (permalink)
References	<20221023155916.00004072@reddwarf.jmc.corp> <tj3llf$1938f$2@dont-email.me>
Organization	Jupiter Mining Corporation
Date	2022-10-23 16:18 +0100

Cross-posted to 5 groups.

Show all headers | View raw

On Sun, 23 Oct 2022 10:12:47 -0500
olcott <polcott2@gmail.com> wrote:

> *Please do not post to comp.lang.c or you will kill it*
> 
> On 10/23/2022 9:59 AM, Mr Flibble wrote:
> > Hi!
> > 
> > Simulating halt deciders (SHDs) simply do not work.
> > 
> > Why? A turing machine should be able to implement ANY algorithm and
> > as such it is an idealisation, an INFINITE STATE MACHINE (ISM) if
> > you will. 
> 
> The machine operates on an infinite[4] memory tape divided into
> discrete cells,[5] each of which can hold a single symbol drawn from
> a finite set of symbols called the alphabet of the machine. It has a
> "head" that, at any point in the machine's operation, is positioned
> over one of these cells, and a "state" selected from a *finite set of
> states*. https://en.wikipedia.org/wiki/Turing_machine

Nope. I am including the tape as part of the machine's state just as we
include machine memory as being part of an SHD's state.

/Flibble

Back to comp.lang.c++ | Previous | Next — Previous in thread | Find similar | Unroll thread

Thread

Simulating halt deciders (SHDs) simply do not work; alas neither does Olcott. Mr Flibble <flibble@reddwarf.jmc.corp> - 2022-10-23 15:59 +0100
  Re: Simulating halt deciders (SHDs) simply do not work; alas neither does Olcott. Mr Flibble <flibble@reddwarf.jmc.corp> - 2022-10-23 16:18 +0100

csiph-web