Algorithms: A quest for absolute definitions (2003)
Cached
Download Links
- [www.math.lsa.umich.edu]
- [research.microsoft.com]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
by
Andreas Blass
,
Yuri Gurevich
| Venue: | Bulletin of the European Association for Theoretical Computer Science |
| Citations: | 13 - 6 self |
BibTeX
@ARTICLE{Blass03algorithms:a,
author = {Andreas Blass and Yuri Gurevich},
title = {Algorithms: A quest for absolute definitions},
journal = {Bulletin of the European Association for Theoretical Computer Science},
year = {2003}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
y Abstract What is an algorithm? The interest in this foundational problem is not only theoretical; applications include specification, validation and verification of software and hardware systems. We describe the quest to understand and define the notion of algorithm. We start with the Church-Turing thesis and contrast Church's and Turing's approaches, and we finish with some recent investigations.
