XPost: comp.theory, sci.logic, comp.lang.c++
XPost: comp.lang.c

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.

A simulating halt decider (SHD) can only over be implemented as a FINITE
STATE MACHINE (FSM) so is not suitable for a) solving the halting
problem or b) refuting the halting problem proofs.

Olcott has wasted the last 18 years of his life with what he thinks he
invented (SHDs). Alas the deluded dear hasn't even invented a halt
decider, all he has invented is a particularly useless form of
simulation detector.

/Flibble

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

XPost: comp.theory, sci.logic

*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


--
Copyright 2022 Pete Olcott "Talent hits a target no one else can hit;
Genius hits a target no one else can see." Arthur Schopenhauer

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

XPost: comp.theory, sci.logic, comp.lang.c++
XPost: comp.lang+c

On Sun, 23 Oct 2022 10:12:47 -0500
olcott <[email protected]> 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

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)