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.
*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
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 366 |
Nodes: | 16 (2 / 14) |
Uptime: | 17:18:10 |
Calls: | 7,812 |
Files: | 12,927 |
Messages: | 5,766,217 |