Abstract
Over the past two decades, Gurevich and his colleagues have developed axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized them in a new framework of abstract state machines. Recently, this approach was extended to suggest axiomatic foundations for the notion of effective computation over arbitrary countable domains. This was accomplished in three different ways, leading to three, seemingly disparate, notions of effectiveness. We show that, though having taken different routes, they all actually lead to precisely the same concept. With this concept of effectiveness, we establish that there is – up to isomorphism – exactly one maximal effective model across all countable domains.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blass, A., Dershowitz, N., Gurevich, Y.: Exact exploration. Technical Report MSR-TR-2009-99, Microsoft Research, Redmond, WA (2010), http://research.microsoft.com/pubs/101597/Partial.pdf ; A short version to appear as Algorithms in a world without full equality. In: The Proceedings of the 19th EACSL Annual Conference on Computer Science Logic, Brno, Czech Republic. LNCS. Springer, Heidelberg (August 2010)
Boker, U., Dershowitz, N.: Comparing computational power. Logic Journal of the IGPL 14, 633–648 (2006)
Boker, U., Dershowitz, N.: The Church-Turing thesis over arbitrary domains. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 199–229. Springer, Heidelberg (2008)
Boker, U., Dershowitz, N.: The influence of domain interpretations on computational models. Journal of Applied Mathematics and Computation 215, 1323–1339 (2009)
Dershowitz, N., Gurevich, Y.: A natural axiomatization of computability and proof of Church’s Thesis. Bulletin of Symbolic Logic 14, 299–350 (2008)
Gurevich, Y.: Sequential abstract state machines capture sequential algorithms. ACM Transactions on Computational Logic 1, 77–111 (2000)
Lambert Jr., W.M.: A notion of effectiveness in arbitrary structures. The Journal of Symbolic Logic 33, 577–602 (1968)
Mal’tsev, A.: Constructive algebras I. Russian Mathematical Surveys 16, 77–129 (1961)
Montague, R.: Towards a general theory of computability. Synthese 12, 429–438 (1960)
Myhill, J.: Some philosophical implications of mathematical logic. Three classes of ideas. The Review of Metaphysics 6, 165–198 (1952)
Rabin, M.O.: Computable algebra, general theory and theory of computable fields. Transactions of the American Mathematical Society 95, 341–360 (1960)
Reisig, W.: The computable kernel of abstract state machines. Theoretical Computer Science 409, 126–136 (2008)
Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1966)
Shapiro, S.: Acceptable notation. Notre Dame Journal of Formal Logic 23, 14–20 (1982)
Stoltenberg-Hansen, V., Tucker, J.V.: 4. In: Effective Algebra. Handbook of Logic in Computer Science, vol. 4, pp. 357–526. Oxford University Press, Oxford (1995)
Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42, 230–265 (1936-1937); Corrections in vol. 43, pp. 544–546 (1937), Reprinted in Davis M. (ed.): The Undecidable. Raven Press, Hewlett (1965), http://www.abelard.org/turpap2/tp2-ie.asp
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Boker, U., Dershowitz, N. (2010). Three Paths to Effectiveness. In: Blass, A., Dershowitz, N., Reisig, W. (eds) Fields of Logic and Computation. Lecture Notes in Computer Science, vol 6300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15025-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-15025-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15024-1
Online ISBN: 978-3-642-15025-8
eBook Packages: Computer ScienceComputer Science (R0)