Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.c++ > #87141
| From | Mr Flibble <flibble@reddwarf.jmc.corp> |
|---|---|
| Newsgroups | comp.theory, sci.logic, comp.lang.c++, comp.ai.philosophy, comp.lang.c |
| Subject | Simulating halt deciders (SHDs) simply do not work; alas neither does Olcott. |
| Message-ID | <20221023155916.00004072@reddwarf.jmc.corp> (permalink) |
| Organization | Jupiter Mining Corporation |
| Date | 2022-10-23 15:59 +0100 |
Cross-posted to 5 groups.
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
Back to comp.lang.c++ | Previous | Next — Next in thread | Find similar | Unroll 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