Bulletin of Symbolic Logic
- Bull. Symbolic Logic
- Volume 15, Issue 2 (2009), 145-168.
When are two algorithms the same?
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.
Bull. Symbolic Logic Volume 15, Issue 2 (2009), 145-168.
First available in Project Euclid: 2 June 2009
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Blass, Andreas; Dershowitz, Nachum; Gurevich, Yuri. When are two algorithms the same?. Bull. Symbolic Logic 15 (2009), no. 2, 145--168. doi:10.2178/bsl/1243948484. https://projecteuclid.org/euclid.bsl/1243948484