When are two algorithms the same?
Blass, Andreas ; Dershowitz, Nachum ; Gurevich, Yuri
Bull. Symbolic Logic, Tome 15 (2009) no. 1, p. 145-168 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 2009-06-15
Classification:  
@article{1243948484,
     author = {Blass, Andreas and Dershowitz, Nachum and Gurevich, Yuri},
     title = {When are two algorithms the same?},
     journal = {Bull. Symbolic Logic},
     volume = {15},
     number = {1},
     year = {2009},
     pages = { 145-168},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1243948484}
}

Blass, Andreas; Dershowitz, Nachum; Gurevich, Yuri. When are two algorithms the same?. Bull. Symbolic Logic, Tome 15 (2009) no. 1, pp.  145-168. http://gdmltest.u-ga.fr/item/1243948484/