Re: What is the Result from Invoking this Halt Function?

From: >parr\(*> (gniKyruaL_at_tenretnitb.moc)
Date: 08/08/04 

Date: Sun, 8 Aug 2004 19:54:18 +0000 (UTC)

"Peter Olcott" <olcott@worldnet.att.net> wrote in message
news:XhqRc.186914$OB3.40250@bgtnsc05-news.ops.worldnet.att.net...
| "David C. Ullrich" <ullrich@math.okstate.edu> wrote in message
news:lp0ch0129ml6gmo64nhjci5luuegbtal03@4ax.com...
| > On Sun, 08 Aug 2004 03:27:07 GMT, "Peter Olcott"
<olcott@worldnet.att.net> wrote:
| > >"Daryl McCullough" <daryl@atc-nycorp.com> wrote in message
news:cf3cc40der@drn.newsguy.com...
| > >> Peter Olcott says...
| > >>
| > >> >How exactly and precisely does the
| > >> >ability to create Q a program
| > >> >that sometimes returns incorrect
| > >> >results have anything at all to do
| > >> >with P? P NEVER returns incorrect
| > >> >results. In those cases where
| > >> >the results would otherwise be
| > >> >incorrect, it refrains from
| > >> >returning anything.
| > >>
| > >> Oh, brother. A solution to the
| > >> halting problem would be a program
| > >> H(x,y) that *always* returns a
| > >> result,
| > >
| > >FALSE ASSUMPTION !!!
| >
| > that's a definition, not an
| > assumptoion.
|
| A simple convention of a three valued
| Boolean can be easily derived:
| 1 = true, 0 = false,
| -1 = ImNotTellingYou

Unfortunately you can't use this because all we get is Peter Olcott
telling us over, and over and over andover again. You do not
recognise the possible existence of 'ImNotTellingYou'. You do not
recognise the possible existence of 'false'. You do not recognise
the possible existence of 'true'. All you recognise is
'ImTellingYou'. 

--
)>==ss$$%PARR(º>   Parr

Relevant Pages