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.
%0 Report
%1 Blass2008
%A Blass, Andreas
%A Dershowitz, Nachum
%A Gurevich, Yuri
%D 2008
%K kiwi
%T MSR-TR-2008-20: When are two algorithms the same?
%X 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.
@techreport{Blass2008,
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.},
added-at = {2008-11-14T13:33:38.000+0100},
author = {Blass, Andreas and Dershowitz, Nachum and Gurevich, Yuri},
biburl = {https://www.bibsonomy.org/bibtex/29ee089171d6b32066a89c2e38fb791a4/fraktalek},
citeulike-article-id = {3508738},
institution = {Microsoft Research},
interhash = {39da07f3da9b8c55e5b8e12871c83dec},
intrahash = {9ee089171d6b32066a89c2e38fb791a4},
keywords = {kiwi},
posted-at = {2008-11-13 14:13:53},
priority = {2},
timestamp = {2008-11-14T13:33:40.000+0100},
title = {MSR-TR-2008-20: When are two algorithms the same?},
year = 2008
}