Re: Alan Turing's Halting Problem is incorrectly formed (PART-TWO)

From: |-|erc (gotcha_at_beauty.com)
Date: 06/24/04 

Date: Thu, 24 Jun 2004 13:23:44 GMT

"Aatu Koskensilta" <aatu.koskensilta@xortec.fi> wrote in
> > Let H(x,y) be any Turing machine.... by
> > which we mean that it outputs 1 if E halts
> >
> > so you're not assumiung that any halt function must output 1 if E halts?
>
> In the above I do not speak about any "halting functions". I show that
> for all Turing machines H, there is a Turing machine E, s.t.
>

CRAP ON, YOU WROTE - H SHOULD OUTPUT 1 IF ITS PARAMETER HALTS

LOOK, this is word for word by you
   that it outputs 1 if E halts

you can play invisible subject and the verbphrase all you like, you go into
sufficient detail about H that is entirely equivalent to proof by contradiction.

Ignoring your lies in front of you is your style.

Herc

Relevant Pages