Abstract
I sketch what I think led to the emergence of Abstract State Machines. A central role in this is played by the work of Ashok Chandra and David Harel on computable queries in databases. I also define Chandra-Harel Algebras, and analyse Blum-Shub-Smale computability over these algebras.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Abiteboul, S., Vianu, V.: Generic computation and its complexity. In Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pp. 209–219 (1991)
Ambos-Spies, K.: Polynomial time degrees of NP-sets. In: Börger, E.B (ed.) Trends in Theoretical Computer Science, pp. 95–142. Computer Science Press, Rockville (1988)
Baldwin, J.T.: Definable second-order quantifiers. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics, Perspectives in Mathematical Logic, Chapter 19. Springer (1985)
Barwise, J., Feferman, S. (eds.): Model-Theoretic Logics. Perspectives in Mathematical Logic. Springer, New York (1985)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Complexity and Real Computation. Springer, New York (1998). https://doi.org/10.1007/978-1-4612-0701-6
Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers. Bull. Am. Math. Soc. 21, 1–46 (1989)
Börger, E.: Spektral problem and completeness of logical decision problems. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds.) LaM 1983. LNCS, vol. 171, pp. 333–356. Springer, Heidelberg (1984). https://doi.org/10.1007/3-540-13331-3_50
Börger, E.: Distributed network algorithms. In: Börger, E. (ed.) Trends in Theoretical Computer Science, pp. 347–378. Computer Science Press (1988)
Börger, E.: Logic as machine: complexity relations between programs and formulas. In: Börger, E. (ed.) Trends in Theoretical Computer Science, pp. 59–94. Computer Science Press (1988)
Börger, E.: Mathematical methods in the analysis of algorithms and data structures. In: Börger, E. (ed.) Trends in Theoretical Computer Science, pp. 225–304. Computer Science Press (1988)
Börger, E.: Proving correctness of concurrent programs: a quick introduction. In: Börger, E.B. (ed.) Trends in Theoretical Computer Science, pp. 305–346. Computer Science Press (1988)
Börger, E.: (ed.): Trends in Theoretical Computer Science. Computer Science Press (1988). Papers presented in Udine at a Conference of the Same Title, 24 September–5 October (1984)
Börger, E.: Ten years of CSL conferences (1987–1997). Bull. Eur. Assoc. Theor. Comput. Sci. 63, 62–64 (1997)
Börger, E.: The origins and the development of the ASM method for high level system design and analysis. J. Univ. Comput. Sci. 8(1), 2–74 (2002)
Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (2001)
Borger, E., Gurevich, Y., Graedel, E.: The Classical Decision Problem. Springer, Heidelberg (1997)
Bruderer, H.: Milestones in Analog and Digital Computing. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-40974-6
Chandra, A., Harel, D.: Structure and complexity of relational queries. J. Comput. Syst. Sci. 25(1), 99–128 (1982)
Chandra, A.K.: Generalized program schemas. SIAM J. Comput. 5(3), 402–413 (1976)
Chandra, A.K., Harel, D.: Computable queries for relational data bases (preliminary report). In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 309–318 (1979)
Chandra, A.K., Harel, D.: Computable queries for relational data bases. J. Comput. Syst. Sci. 21, 156–178 (1980)
Chandra, A.K., Lewis, H.R., Makowsky. J.A.: Embedded implicational dependencies and their inference problem. In: Proceedings of the Thirteenth Annual ACM Symposium on Theory of computing, pp. 342–354 (1981)
Crossley, J.N.: John Cedric Shepherdson (1926–2015). https://www.thebritishacademy.ac.uk/documents/1539/08-Shepherdson.pdf
Cucker, F., Wong, R.: The Collected Papers of Stephen Smale. World Scientific (2000)
Dahlhaus, E., Makowsky. J.A.: Computable directory queries: the choice of programming primitives for SETL-like programming languages (1985)
Dahlhaus, E., Makowsky, J.A.: Gandy’s principles for mechanisms as a model of parallel computation. In: Herken, R. (ed.), The Universal Turing Machine: A Half-Century Survey, pp. 83–288. Kammerer & Unverzagt, Berlin and Oxford University Press (1988)
Dahlhaus, E., Makowsky, J.A.: Query languages for hierarchic databases. Inf. Comput. 101(1), 1–32 (1992)
Durand, A., Jones, D.A., Makowsky, J.A., More, M.: Fifty years of the spectrum problem: survey and new results. Bull. Symbol. Logic 18(4), 505–553 (2012)
Engeler, E.: Algorithmic properties of structures. Math. Syst. Theor. 1(2), 183–195 (1967)
Fagin, R., Karp, R.M.: Complexity of computation. Am. Math. Soc. 7, 43–74 (1974)
Friedman, H.: Algorithmic procedures, generalized turing algorithms, and elementary recursion theory. In: Studies in Logic and the Foundations of Mathematics, vol. 61, pp. 361–389. Elsevier (1971)
Gurevich, Y.: Algebras of feasible functions. In: 24th Annual Symposium on Foundations of Computer Science (SFCS 1983), pp. 210–214. IEEE (1983)
Gurevich, Y.: Monadic second-order theories. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics, Perspectives in Mathematical Logic, Chapter 19. Springer (1985)
Gurevich, Y.: Algorithms in the world of bounded resources. In: Herken, R. (ed.) The Universal Turing Machine: A Half-Century Survey, pp. 407–416. Kammerer & Unverzagt and Oxford University Press, Oxford and New York (1988)
Gurevich, Y.: Logic and the challenge of computer science. In: Börger, E. (ed.) Trends in Theoretical Computer Science, Principles of Computer Science Series, Chapter 1. Computer Science Press (1988)
Gurevich, Y.: Abstract state machines: an overview of the project. In: Seipel, D., Turull-Torres, J.M. (eds.) FoIKS 2004. LNCS, vol. 2942, pp. 6–13. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24627-5_2
Gutknecht, M.H.: Numerical analysis in Zurich: 50 years ago. Swiss Mathematical Society 1910–2010, pp. 279–290 (2010)
Herken, R. (ed.): The Universal Turing Machine: A Half-Century Survey. Kammerer % Unverzagt, Berln and Oxford University Press (1988). Reprinted by Oxford University Press, 1988, 1992, reprinted by Springer Verlag, Vienna (1995)
Ianov, T.I.: On matrix program schemes. Commun. ACM 1(12), 3–6 (1958)
Ianov, J.I.: On the equivalence and transformation of program schemes. Commun. ACM 1(10), 8–12 (1958)
Ianov, J.I.: The logical schemes of algorithms. Probl. Cybernet. (USSR) 1, 82–140 (1960)
Igarashi, S.: On the logical schemes of algorithms. Inf. Process. Jpn. 3, 12–18 (1963)
Immerman, N.: Relational queries computable in polynomial time (extended abstract). In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (1982)
Jensen, K., Wirth, N.: Pascal user manual and report (1974)
Jones, N.D., Selman, A.I.: Turing machines and the spectra of first-order formulas. J. Symbol. Logic 39(1), 139–150 (1974)
Luckham, D.C., Park, D.M., Paterson, M.S.: On formalised computer programs. J. Comput. Syst. Sci. 4(3), 220–249 (1970)
Makowsky, J.A.: BSS computing over Chandra-Harel algebras (in preparation)
Makowsky, J.A.: Model Theoretic Issues in Theoretical Computer Science, Part I: Relational Data Bases and Abstract Data Types. Technical Report, Computer Science Department, Technion (1983)
Makowsky, J.A.: Model theoretic issues in theoretical computer science, Part I: relational data bases and abstract data types. In: Studies in Logic and the Foundations of Mathematics, vol. 112, pp. 303–343. Elsevier (1984)
Makowsky, J.A.: Abstract embedding relations. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics, Perspectives in Mathematical Logic, Chapter 20. Springer (1985)
Makowsky, J.A.: Compactness, embeddings and definability. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics, Perspectives in Mathematical Logic, Chapter 18. Springer (1985)
Makowsky, J.A., Mundici. D.: Abstract equivalence relations. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics, Perspectives in Mathematical Logic, Chapter 19. Springer (1985)
Paterson, M.S.: Equivalence problems in a model of computation. PhD thesis, Trinity College, University of Cambridge (1967)
Péter, R.: Rekursive funktionen, Budapest, vol. 57 (1951)
Péter, R.: Rekursive Funktionen in der Computer Theorie, Budapest (1976)
Rutledge, J.D.: On Ianov’s program schemata. J. ACM (JACM) 11(1), 1–9 (1964)
Shepherdson, J.C.: Computation over abstract structures: serial and parallel procedures and Friedman’s effective definitional schemes. In: Studies in Logic and the Foundations of Mathematics, vol. 80, pp.445–513. Elsevier (1975)
Shepherdson, J.C., Sturgis, H.E.: Computability of recursive functions. J. ACM (JACM) 10(2), 217–255 (1963)
Smale, S.: The fundamental theorem of algebra and complexity theory. Bull. Am. Math. Soc. 4(1), 1–36 (1981)
Specker, E.: Application of logic and combinatorics to enumeration problems. In: Börger, E. (ed.) Trends in Theoretical Computer Science, pp.141–169. Computer Science Press, 1988. Reprinted. In: Ernst Specker, Selecta, Birkhäuser, pp. 324–350 (1990)
Vardi, M.: Fundamentals of dependency theory. In: Trends in Theoretical Computer Science, pp. 171–224. Computer Science Press (1988)
Vardi, M.Y.: The complexity of relational query languages. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 137–146 (1982)
Wikipedia: Register machine. https://en.wikipedia.org/wiki/Register_machine. Accessed 13 Mar 2021
Acknowledgements
I would like to thank Y. Gurevich, M. Prunescu and K.-D. Schewe for some critical remarks, and L. Beklemishev and D. Harel for the permission to include pictures they provided. All pictures our either in the public domain or courtesy their respective copyright owners.
The pictures of E. Stiefel, H. Rutishauser, P. Läuchli, N. Wirth and E. Engeler are taken from their respective pages of ETHZ. The pictures of the Curta and the Arithmometer belong to the National Museum of Computing and the Computer History Museum respectively. The picture of Yu. Ianov was provided by Alexey Yashunsky from the Keldysh institute were Ianov worked all his life. The pictures of J. Shepherdson is taken from his obituary [23]. The pictures of H. Friedman, N. Immerman and M. Vardi are from their Wikipedia entries. Finally, the pictures of L. Blum, F. Cucker, M. Shub and S. Smale was provided by them and also appears in the collected papers of S. Smale [24].
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Makowsky, J.A. (2021). Some Thoughts on Computational Models: From Massive Human Computing to Abstract State Machines, and Beyond. In: Raschke, A., Riccobene, E., Schewe, KD. (eds) Logic, Computation and Rigorous Methods. Lecture Notes in Computer Science(), vol 12750. Springer, Cham. https://doi.org/10.1007/978-3-030-76020-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-76020-5_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-76019-9
Online ISBN: 978-3-030-76020-5
eBook Packages: Computer ScienceComputer Science (R0)