Ordinary interactive small-step algorithms

ACM Transactions on Computational Logic

Volumn 7, Issue 2, 2006, Pages 363-419

  Blass, Andreas ^a   Gurevich, Yuri ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Abstract state machines; Equivalence of algorithms; Interaction; Postulates; Sequential algorithms

Indexed keywords

ABSTRACT STATE MACHINES; EQUIVALENCE OF ALGORITHMS; INTERACTION; POSTULATES; SEQUENTIAL ALGORITHMS;

CODES (SYMBOLS); COMBINATORIAL MATHEMATICS; QUERY LANGUAGES;

ALGORITHMS;

EID: 33745218013     PISSN: 15293785     EISSN: 15293785     Source Type: Journal    
DOI: 10.1145/1131313.1131320     Document Type: Article

References (16)

1. The AsmL webpage, http://research.microsoft.com/foundations/AsmL/.
2. BLASS, A., GUREVICH, Y., AND SHELAH, S. 1999. Choiceless polynomial time. Ann. Pure Appl. Logic 100, 141-187.
3. BLASS, A. AND GUREVICH, Y. 2000. Background, reserve, and Gandy machines. In Computer Science Logic 14th International Workshop, CSL 2000, Annual Conference of the EACSL (Fischbachau, Germany, Aug., 2000), P. Clote and H. Schwichtenberg, Eds. Springer Verlag, Lecture Notes in Computer Science 1862, 1-17.
4. BLASS, A. AND GUREVICH, Y. 2003a. Strong extension axioms and Shelah's zero-one law for choice-less polynomial time. J. Symbo. Logic 68, 65-131.
5. BLASS, A. AND GUREVICH, Y. 2003b. Abstract state machines capture parallel algorithms. ACM Trans. Comput. Logic 4, 4, 578-651.
6. BLASS, A. AND GUREVICH, Y. 2003c. Algorithms: A quest for absolute definitions. Bull. Europ. Assoc. Theoret. Camp. Sci. 81, 195-225.
7. BLASS, A., GUREVICH, Y., AND ROSSMAN, B. General interactive small-step algorithms. In preparation.
8. GUREVICH, Y. 1995. Evolving algebra 1993: Lipari guide. In Specification and Validation Methods. E. Börger, Ed. Oxford University Press, 9-36.
9. GUHEVICH, Y. 1997. ASM guide. University of Michigan Technical Report CSE-TR-336-97. See [Huggins].
10. GUREVICH, Y. 2000. Sequential abstract state machines capture sequential algorithms. ACM Trans. Comput. Logic 1, 1, 77-111.
11. HUOOINS, J. K. ASM Michigan webpage. http://www.eecs.umich.edu/gasm.
12. MINLNER, R. 1999. Communicating and Mobile Systems: the π-Calculus, Cambridge University Press.
13. MOSCHOVAKIS, Y. N. 2001. What is an algorithm? In Mathematics Unlimited. B. Engquist and W. Schmid, Eds. Springer-Verlag 919-936.
14. TURING, A. M. 1936-1937. On computable numbers, with an application to the Entscheidungs problem. Proceedings of London Mathematical Society, series 2, vol. 42(1936-1937), 230-265;
15. TURING, A. M., correction, ibid., vol. 43, 544-546. Available online athttp://www.abelard.org/turpap2/tp2-ie.asp.
16. WEGNER, P. AND GOLDIN, D. 1999. Interaction as a framework for modeling. In Conceptual Modeling. P. Chen et al, Eds. Springer Lecture Notes in Computer Science 1565, 243-257.