Computability and complexity

Stanford Encyclopedia of Philosophy (2008)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,004

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Compositionality, Computability, and Complexity.Peter Pagin - 2021 - Review of Symbolic Logic 14 (3):551-591.
Computability and Complexity: From a Programming Perspective Vol. 21.N. D. Jones - 1997 - MIT Press.
Definability in the class of all -frames – computability and complexity.D. T. Georgiev - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):1-26.
REVIEWS-A first course in logic: An introduction to model theory, proof theory, computability, and complexity.S. Hedman & Alasdair Urquhart - 2007 - Bulletin of Symbolic Logic 13 (4):538-539.
Computability-theoretic complexity of countable structures.Valentina S. Harizanov - 2002 - Bulletin of Symbolic Logic 8 (4):457-477.
Jones Neil D., Computability and complexity, From a programming perspective, Foundations of computing, The MIT Press, Cambridge, Mass., and London, 1997, xvi + 466 pp. [REVIEW]James S. Royer - 1999 - Journal of Symbolic Logic 64 (2):914-916.
A first course in logic: an introduction to model theory, proof theory, computability, and complexity.Shawn Hedman - 2004 - New York: Oxford University Press.
[Omnibus Review].James Royer - 1999 - Journal of Symbolic Logic 64 (2):914-916.
Is Complexity Important for Philosophy of Mind?Kristina Šekrst & Sandro Skansi - manuscript
Effective fractal dimensions.Jack H. Lutz - 2005 - Mathematical Logic Quarterly 51 (1):62-72.

Analytics

Added to PP
2009-01-28

Downloads
21 (#1,101,379)

6 months
1 (#1,609,017)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Compositionality, Computability, and Complexity.Peter Pagin - 2021 - Review of Symbolic Logic 14 (3):551-591.

Add more citations

References found in this work

Introduction to metamathematics.Stephen Cole Kleene - unknown - Groningen: P. Noordhoff N.V..
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Principia mathematica.Alfred North Whitehead & Bertrand Russell - 1910 - Cambridge,: University Press. Edited by Bertrand Russell.

View all 12 references / Add more references