Summary
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 intrastep interaction of an algorithm with its environment. Here we motivate and survey recent work on interactive algorithms within the Behavioral Computation Theory project.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ASM Michigan webpage, http://www.eecs.umich.edu/gasm/, maintained by J. K. Huggins.
The AsmL webpage, http://research.microsoft.com/foundations/AsmL/.
A. Blass and Y. Gurevich. “Abstract State Machines Capture Parallel Algorithms,” ACM Trans. on Computational Logic, 4:4, 2003, pp. 578–651.
A. Blass and Y. Gurevich. “Algorithms: A Quest for Absolute Definitions,” Bull. Euro. Assoc. for Theor. Computer Science Number 81, October 2003, pp. 195–225. Reprinted in Current Trends in Theoretical Computer Science: The Challenge of the New Century, Vol. 2, eds. G. Paun et al., World Scientific, 2004, pp. 283–312.
A. Blass and Y. Gurevich. “Ordinary Interactive Small-Step Algorithms”, parts I, II, III, ACM Trans. on Computational Logic, to appear. Microsoft Research Technical Reports MSR-TR-2004-16 and MSR-TR-2004-88.
A. Blass, Y. Gurevich, D. Rosenzweig and B. Rossman. Four articles on interactive algorithms, in preparation. Article 1: “General Interactive Small-Step Algorithms”. Article 2: “Composite Interactive Algorithms”. Article 3: “Interactive Algorithms: Impatience and Time Sensitivity”. Article 4: “Interactive Wide-Step Algorithms”. The last three titles are tentative.
E. Börger and R. Stärk. “Abstract State Machines: A Method for High-Level System Design and Analysis”, Springer-Verlag, 2003.
T. H. Cormen, C. E. Leiserson and R. L. Rivest. “Introduction to Algorithms” MIT Press, 1990.
D. Q. Goldin, S. A. Smolka, P. C. Attie, E. L. Sonderegger. “Turing Machines, Transition Systems, and Interaction”, Information and Computation 194:2, 2004, pp. 101–128.
D. Q. Goldin and P. Wegner. “Principles of Interactive Computation”, this volume.
Y. Gurevich. “Evolving Algebras: An Introductory Tutorial”, Bull. Euro. Assoc. for Theor. Computer Science 43, February 1991, pp. 264–284. A slightly revised version is published in Current Trends in Theoretical Computer Science, eds. G. Rozenberg and A. Salomaa, World Scientific, 1993, pp. 266–292.
Y. Gurevich. “Evolving Algebra 1993: Lipari Guide,” in Specification and Validation Methods, ed. E. Börger, Oxford University Press, 1995, pp. 9–36.
Y. Gurevich. “Sequential Abstract State Machines Capture Sequential Algorithms,” ACM Trans. on Computational Logic 1:1, 2000, pp. 77–111.
Y. Gurevich. “Interactive Algorithms 2005”, Proceedings of the 2005 conference on Mathematical Foundations of Computer Science, Springer Lecture Notes in Computer Science 3618, 2005, pp. 26–38, eds. J. Jedrzejowicz and A. Szepietowski.
A. N. Kolmogorov. “On the Concept of Algorithm”, Uspekhi Mat. Nauk 8:4, 1953, pp. 175–176, Russian.
F. T. Leighton. “Introduction to Parallel Algorithms and Architectures; Arrays, Trees, Hypercubes”, MIT Press, 1992.
N. A. Lynch. “Distributed Algorithms”, Morgan Kaufmann Publishers, 1996.
A. A. Markov. “Theory of Algorithms”, Transactions of the Steklov Institute of Mathematics, vol. 42, 1954, Russian. Translated to English by the Israel Program for Scientific Translations, Jerusalem, 1962.
A. M. Turing. “On Computable Numbers, with an Application to the Entscheidungsproblem”, Proceedings of London Mathematical Society, series 2, vol. 42, 1936, pp. 230–265; correction, ibidem, vol. 43, pp. 544–546.
P. Wegner. “Interactive Foundation of Computing”, Theoretical Computer Science 192, 1998, pp. 315–351.
P. Wegner. “Why Interaction is More Powerful than Algorithms”, Communications of ACM, May 1997, pp. 81–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gurevich, Y. (2006). Interactive Algorithms 2005 with Added Appendix. In: Goldin, D., Smolka, S.A., Wegner, P. (eds) Interactive Computation. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-34874-3_8
Download citation
DOI: https://doi.org/10.1007/3-540-34874-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34666-1
Online ISBN: 978-3-540-34874-0
eBook Packages: Computer ScienceComputer Science (R0)