Re: Unpredictable programming

From: Marshall <>
Date: 28 Jun 2006 21:22:49 -0700
Message-ID: <>

Bob Badour wrote:


> However, I suspect
> the task of recognizing the equivalence of any two arbitrary algorithms
> is probably close to the complexity of the halting problem.

In both cases, the problem is in general undecidable. Of course individual
instances of the problem may be decidable.  

Marshall Received on Thu Jun 29 2006 - 06:22:49 CEST

Original text of this message