Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: Unpredictable programming

Re: Unpredictable programming

From: Marshall <marshall.spight_at_gmail.com>
Date: 28 Jun 2006 21:22:49 -0700
Message-ID: <1151554969.349160.313850@p79g2000cwp.googlegroups.com>


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 Wed Jun 28 2006 - 23:22:49 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US