Background, Reserve, and Gandy Machines
The reserve of a state of an abstract state machine was defined to be a “naked set”. In applications, it may be convenient to have tuples, sets, lists, arrays, etc. defined ahead of time on all elements, including the reserve elements. We generalize the notion of reserve appropriately. As an application, we solve a foundational problem in Gandy’s formalization of mechanical devices.
Unable to display preview. Download preview PDF.
- BGS 1999.
- Enderton 1972.Herbert B. Enderton, “A Mathematical Introduction to Logic,” Academic Press.Google Scholar
- Gandy 1980.Robin Gandy, “Church’s thesis and principles for mechanisms” in: “The Kleene Symposium” (ed. J. Barwise et al.), North-Holland, 1980, 123–148.Google Scholar
- Gurevich 1991.“Evolving Algebras: An Attempt to Discover Semantics”, Bulletin of European Assoc. for Theor. Computer Science, no. 43, Feb. 1991, 264–284. A slightly revised version appeared in G. Rozenberg and A. Salomaa, editors, “Current Trends in Theoretical Computer Science”, World Scientific, 1993, 266–292.Google Scholar
- Gurevich 1995.Yuri Gurevich, “Evolving Algebra 1993: Lipari Guide”, in “Specification and Validation Methods”, Ed. E. Boerger, Oxford University Press, 1995, 9–36.Google Scholar
- Gurevich 2000.Yuri Gurevich, “Sequential Abstract State Machines Capture Sequential Algorithms”, ACM Transactions on Computational Logic 1, to appear.Google Scholar