Background, reserve, and gandy machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1862, Issue , 2000, Pages 1-17

  Blass, Andreas ^a   Gurevich, Yuri ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RECONFIGURABLE HARDWARE;

ABSTRACT STATE MACHINES; FOUNDATIONAL PROBLEMS; MECHANICAL DEVICE;

COMPUTER CIRCUITS;

EID: 84959341198     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44622-2_1     Document Type: Conference Paper

References (7)

1. Andreas Blass, Yuri Gurevich and Saharon Shelah, “Choiceless Polynomial Time”, Annals of Pure and Applied Logic 100 (1999), 141–187.
2. Herbert B. Enderton, “A Mathematical Introduction to Logic,” Academic Press.
3. Robin Gandy, “Church’s thesis and principles for mechanisms” in: “The Kleene Symposium” (ed. J. Barwise et al.), North-Holland, 1980, 123–148.
4. “Evolving Algebras: An Attempt to Discover Semantics”, Bulletin of European Assoc. for Theor. Computer Science, no. 43, Feb. 1991, 264–284.
5. A slightly revised version appeared in G. Rozenberg and A. Salomaa, editors, “Current Trends in Theoretical Computer Science”, World Scientific, 1993, 266–292.
6. Yuri Gurevich, “Evolving Algebra 1993: Lipari Guide”, in “Specification and Validation Methods”, Ed. E. Boerger, Oxford University Press, 1995, 9–36.
7. Yuri Gurevich, “Sequential Abstract State Machines Capture Sequential Algorithms”, ACM Transactions on Computational Logic 1, to appear.