Author: James Swafford
Date: 09:36:11 02/04/06
Go up one level in this thread
On February 04, 2006 at 09:00:11, Uri Blass wrote: >On February 04, 2006 at 08:30:51, James Swafford wrote: > >>On February 04, 2006 at 01:53:28, Joseph Tadeusz wrote: >> >>[snip] >> >>> >>>You said: "100% correct decompilation is PROVABLY impossible" >>> >>>I understood you meant 'for any program', >>>but I suppose you meant 'for all programs'. >> >> >>That's generally what that statement means. The halting problem >>is proven to be uncomputable, though you can certainly figure it >>out for some programs. >> >>-- >>James > >A program cannot compute the halting problem. >It does not thing that it is not possible to build another tool that is not a >program that can compute the halting problem. Ok, you have to give a precise definition of a computer if you claim something is uncomputable. Of course I'm referring to a Turing machine. The halting problem is uncomputable using a Turing machine. If you have something more powerful than a Turing machine, then of course the classic proof would not apply. -- James > >Uri
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.