Just a sample of the Echomail archive
COMPLANC:
[ << oldest | < older | list | newer > | newest >> ]
|  Message 241,621 of 243,097  |
|  wij to olcott  |
|  Re: H(D) as simple as it gets  |
|  29 Oct 25 01:01:44  |
 
From: wyniijj5@gmail.com
On Tue, 2025-10-28 at 11:24 -0500, olcott wrote:
> On 10/28/2025 10:19 AM, wij wrote:
> > On Tue, 2025-10-28 at 09:29 -0500, olcott wrote:
> > > On 10/28/2025 8:03 AM, wij wrote:
> > > > On Mon, 2025-10-27 at 23:29 -0700, Chris M. Thomasson wrote:
> > > > > Humm...
> > > > >
> > > > > 1 HOME
> > > > > 5 PRINT "The Olcott All-in-One Halt Decider!"
> > > > > 10 INPUT "Shall I halt or not? " ; A$
> > > > > 30 IF A$ = "YES" GOTO 666
> > > > > 40 GOTO 10
> > > > > 666 PRINT "OK!"
> > > >
> > > > Yes, HP is just that simple. The not-so-simple part (just a little
bit) is
> > > > making it precise to become a theorem. olcott wants to save human (not
really)
> > > > and AI industry. BASIC is too... well, kid stuff, not famous and big
enough to
> > > > exhibit the 3% intelligence. Being Simple and clear is olcott's
enermy.
> > > >
> > >
> > > *D simulated by H cannot possibly reach past its own first line*
> > >
> > > int D()
> > > {
> > > int Halt_Status = H(D);
> > > if (Halt_Status)
> > > HERE: goto HERE;
> > > return Halt_Status;
> > > }
> > >
> > > H simulates D
> > > that calls H(D) to simulate D
> > > that calls H(D) to simulate D
> > > that calls H(D) to simulate D
> > > that calls H(D) to simulate D
> > > that calls H(D) to simulate D
> > > until H sees this repeating pattern.
> >
> > 'D' (or DDD, whatever, although they look similar) is not the example
mentioned
> > in the HP proof. You are solving POO Problem.
> >
>
> The proof has no idea about simulating halt deciders.
The HP proof only needs a 'given' halt decider.
As a proof (in this case), you must provide a reproducable halt decider for
reviewers. So far, none, just mouth: "I have one".
> I cannot begin to show the next step of my proof
> until people utterly stop stonewalling me on the
> above step. They have done this for three years.
Forget about the 'next'. You should go back to understand what the HP is
asking.
Hint: HP is asking for a TM. Do the exercises in Linz's book to prove to
yourself you understand TM. Text book is not popular-science magzine.
--- SoupGate-Win32 v1.05
* Origin: you cannot sedate... all the things you hate (1:229/2)
|
[ << oldest | < older | list | newer > | newest >> ]
(c) 1994, bbs@darkrealms.ca