When are two algorithms the same?

Bulletin of Symbolic Logic 15 (2):145-168 (2009)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/bsl/1243948484
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,667
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles
Donald Ervin Knuth (2010). Selected Papers on Design of Algorithms. Center for the Study of Language and Information.
Martin Peterson (2011). Is There an Ethics of Algorithms? Ethics and Information Technology 13 (3):251-260.
Mati Pentus (1994). The Conjoinability Relation in Lambek Calculus and Linear Logic. Journal of Logic, Language and Information 3 (2):121-140.
D. Fallis (2000). The Reliability of Randomized Algorithms. British Journal for the Philosophy of Science 51 (2):255-271.

Monthly downloads

Added to index


Total downloads

13 ( #194,523 of 1,726,249 )

Recent downloads (6 months)

1 ( #369,877 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.