Advertisement

Abstract

A sequential algorithm just follows its instructions and thus cannot make a nondeterministic choice all by itself, but it can be instructed to solicit outside help to make a choice. Similarly, an object-oriented program cannot create a new object all by itself; a create-a-new-object command solicits outside help. These are but two examples of intra-step interaction of an algorithm with its environment. Here we motivate and survey recent work on interactive algorithms within the Behavioral Computation Theory project.

Keywords

Sequential Algorithm Characterization Theorem Computational Logic Euclidean Algorithm Answer Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Huggins, J.K.: ASM Michigan Webpage, http://www.eecs.umich.edu/gasm/
  2. 2.
  3. 3.
    Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms. ACM Trans. on Computational Logic 4(4), 578–651 (2003)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Blass, A., Gurevich, Y.: Algorithms: A Quest for Absolute Definitions. In: Bull. Euro. Assoc. for Theor. Computer Science, October 2003, vol. 81, pp. 195–225 (2003); Reprinted in: Paun, G., et al. (eds.)Current Trends in Theoretical Computer Science: The Challenge of the New Century, vol. 2, pp. 283–312. World Scientific, Singapore (2004)Google Scholar
  5. 5.
    Blass, A., Gurevich, Y.: Ordinary Interactive Small-Step Algorithms, I., ACM Trans. on Computational Logic, (to appear); Microsoft Research Tech. Report MSR-TR-2004-16Google Scholar
  6. 6.
    Blass, A., Gurevich, Y.: Ordinary Interactive Small-Step Algorithms, II., ACM Trans. on Computational Logic, (to appear); Microsoft Research Tech. Report MSR-TR-2004-88Google Scholar
  7. 7.
    Blass, A., Gurevich, Y.: Ordinary Interactive Small-Step Algorithms, III., ACM Trans. on Computational Logic, (to appear); Microsoft Research Tech. Report MSR-TR-2004-88, mentioned above, covers this article as well; the material was split into two pieces by the journal because of its article-length restrictionGoogle Scholar
  8. 8.
    Blass, A., Gurevich, Y., Rosenzweig, D., Rossman, B.: General Interactive Small-Step Algorithms (in preparation)Google Scholar
  9. 9.
    Blass, A., Gurevich, Y., Rosenzweig, D., Rossman, B.: Composite Interactive Algorithms (tentative title) (in preparation)Google Scholar
  10. 10.
    Blass, A., Gurevich, Y., Rosenzweig, D., Rossman, B.: Interactive Algorithms: Impatience and Time Sensitivity (tentative title) (in preparation)Google Scholar
  11. 11.
    Blass, A., Gurevich, Y., Rosenzweig, D., Rossman, B.: Interactive Wide-Step Algorithms (in preparation)Google Scholar
  12. 12.
    Börger, E., Stärk, R.: Abstract State Machines: A Method for High-Level System Design and Analysis. Springer, Heidelberg (2003)zbMATHGoogle Scholar
  13. 13.
    Gurevich, Y.: Evolving Algebras: An Introductory Tutorial. Bull. Euro. Assoc. for Theor. Computer Science 43, 264–284 (February 1991); A slightly revised version is published. In: Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science, pp. 266–292. World Scientific, Singapore (1993)Google Scholar
  14. 14.
    Gurevich, Y.: Evolving Algebra 1993: Lipari Guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. Oxford University Press, Oxford (1995)Google Scholar
  15. 15.
    Gurevich, Y.: Sequential Abstract State Machines Capture Sequential Algorithms. ACM Trans. on Computational Logic 1(1), 77–111 (2000)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Kolmogorov, A.N.: On the Concept of Algorithm. Uspekhi Mat. Nauk 8(4), 175–176 (1953) (Russian)zbMATHGoogle Scholar
  17. 17.
    Markov, A.A.: Theory of Algorithms. Transactions of the Steklov Institute of Mathematics 42 (1954) (Russian); Translated to English by the Israel Program for Scientific Translations, Jerusalem (1962)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Yuri Gurevich
    • 1
  1. 1.Microsoft ResearchRedmondUSA

Personalised recommendations