Re: The proof that I was referring to is on the website

From: The Ghost In The Machine (ewill_at_aurigae.athghost7038suus.net)
Date: 08/13/04


Date: Fri, 13 Aug 2004 04:01:18 GMT

In sci.logic, Peter Olcott
<olcott@worldnet.att.net>
 wrote
on Thu, 12 Aug 2004 12:15:22 GMT
<ubJSc.200491$OB3.149139@bgtnsc05-news.ops.worldnet.att.net>:
> If you make you point much more succinctly I will respond to it.

You want succinct? Try this.

Given any machine type Mx with side effect x, I can construct an
isomorphic standard Turing machine M(x). If you have a
WillHaltx, I can construct a WillHalt(x). Since WillHalt(x)
is impossible, WillHaltx is also impossible.

I can't make it much more succinct than that. :-P

[rest snipped for succinctness]

-- 
#191, ewill3@earthlink.net
It's still legal to go .sigless.


Relevant Pages