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.
| Original language | English |
|---|---|
| Pages (from-to) | 145-168 |
| Number of pages | 24 |
| Journal | Bulletin of Symbolic Logic |
| Volume | 15 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jun 2009 |