When are two algorithms the same?

Bulletin of Symbolic Logic 15 (2):145-168 (2009)

Abstract

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

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,694

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2010-09-13

Downloads
49 (#235,221)

6 months
1 (#388,319)

Historical graph of downloads
How can I increase my downloads?

Similar books and articles

On Logic of Complex Algorithms.Helena Rasiowa - 1981 - Studia Logica 40 (3):289 - 310.
Selected Papers on Design of Algorithms.Donald Ervin Knuth - 2010 - Center for the Study of Language and Information.
Is There an Ethics of Algorithms?Martin Peterson - 2011 - Ethics and Information Technology 13 (3):251-260.
The Conjoinability Relation in Lambek Calculus and Linear Logic.Mati Pentus - 1994 - Journal of Logic, Language and Information 3 (2):121-140.
How to Think About Algorithms.Jeff Edmonds - 2008 - Cambridge University Press.
Best Unifiers in Transitive Modal Logics.Vladimir V. Rybakov - 2011 - Studia Logica 99 (1-3):321-336.
The Reliability of Randomized Algorithms.D. Fallis - 2000 - British Journal for the Philosophy of Science 51 (2):255-271.