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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/bsl/1243948484
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 63,194
Through your library

References found in this work BETA

Add more references

Citations of this work BETA

What is a Simulation Model?Juan M. Durán - 2020 - Minds and Machines 30 (3):301-323.

View all 7 citations / Add more citations

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.

Analytics

Added to PP index
2010-09-13

Total views
48 ( #221,995 of 2,448,313 )

Recent downloads (6 months)
1 ( #450,727 of 2,448,313 )

How can I increase my downloads?

Downloads

My notes