When are two algorithms the same?

Andreas Blass*, Nachum Dershowitz, Yuri Gurevich

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)145-168
Number of pages24
JournalBulletin of Symbolic Logic
Issue number2
StatePublished - Jun 2009


Dive into the research topics of 'When are two algorithms the same?'. Together they form a unique fingerprint.

Cite this