Bulletin of Symbolic Logic

When are two algorithms the same?

Andreas Blass, Nachum Dershowitz, and Yuri Gurevich

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


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.

Article information

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

Export citation