Translator Disclaimer
June 2009 When are two algorithms the same?
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
Bull. Symbolic Logic 15(2): 145-168 (June 2009). DOI: 10.2178/bsl/1243948484

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.

Citation

Download Citation

Andreas Blass. Nachum Dershowitz. Yuri Gurevich. "When are two algorithms the same?." Bull. Symbolic Logic 15 (2) 145 - 168, June 2009. https://doi.org/10.2178/bsl/1243948484

Information

Published: June 2009
First available in Project Euclid: 2 June 2009

zbMATH: 1192.03021
MathSciNet: MR2535427
Digital Object Identifier: 10.2178/bsl/1243948484

Rights: Copyright © 2009 Association for Symbolic Logic

JOURNAL ARTICLE
24 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.15 • No. 2 • June 2009
Back to Top