Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2008
Springer

favoriteEmaildiscussreport

50views Education» more CORR 2008»

When are two algorithms the same?

13 years 4 months ago

When are two algorithms the same?

Download www.cs.tau.ac.il

People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.

Andreas Blass, Nachum Dershowitz, Yuri Gurevich

Real-time Traffic

Algorithms | CORR 2008 | Education | Equivalence Relation | Suitable Equivalence Relation |

claim paper

Related Content

» When Do Bounds and Domain Propagation Lead to the Same Search Space

» Judging Whether Multiple Silhouettes Can Come from the Same Object

» Joke retrieval recognizing the same joke told differently

» Are You with Me Using Accelerometers to Determine If Two Devices Are Carried by the Same ...

» Finding corresponding objects when integrating several geospatial datasets

» Less Hashing Same Performance Building a Better Bloom Filter

» Window And Backwards Decoding Achieve the Same Sum Rate for the Fading Cooperative Gaussia...

» The DCASOMe Comparison A comparative study between two biologicallyinspired algorithms

» Exploration of a Two Sided Rendezvous Search Problem Using Genetic Algorithms

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Andreas Blass, Nachum Dershowitz, Yuri Gurevich

Comments (0)