Skip to main content
Article thumbnail
Location of Repository

Some Things Algorithms Cannot Do

By Dean Rosenzweig and Davor Runje

Abstract

A new, ‘behavioral ’ theory of algorithms, intending to capture algorithms at their intended abstraction level, has been developed in this century in a series of papers by Y. Gurevich, A. Blass and others, motivated initially by the goal of establishing the ASM thesis. A viable theory of algorithms must have its limitative results, algorithms, however abstract, cannot do just anything. We establish some nonclassical limitative results for the behavioral theory: • algorithms cannot distinguish some distinct states; • algorithms cannot reach some existing states; • algorithms cannot access some existing objects. The algorithms studied are interactive, querying an environment, small–step, operating over different background classes. Since our primary motivation is abstract analysis of cryptographic algorithms, our examples come from this field – we believe however that the potential application field is much broader

Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.263
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://crosbi.znanstvenici.hr/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.