Turing’s algorithmic lens: From computability to complexity theory

&
Arbor 189 (764):a080 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.3989/arbor.2013.764n6003

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Algorithmic randomness and measures of complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Game arguments in computability theory and algorithmic information theory.Alexander Shen - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 655--666.
Two dogmas of computationalism.Oron Shagrir - 1997 - Minds and Machines 7 (3):321-44.
Effective fractal dimensions.Jack H. Lutz - 2005 - Mathematical Logic Quarterly 51 (1):62-72.
Computability and Complexity: From a Programming Perspective Vol. 21.N. D. Jones - 1997 - MIT Press.
Turing-, human- and physical computability: An unasked question. [REVIEW]Eli Dresner - 2008 - Minds and Machines 18 (3):349-355.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press UK.
Algorithmic information theory, free will, and the Turing test.Douglas S. Robertson - 1999 - Complexity 4 (3):25-34.
Algorithmic randomness and complexity. Theory and Applications of Computability.Rodney G. Downey & Denis R. Hirschfeldt - 2012 - Bulletin of Symbolic Logic 18 (1):126-128.
Turing oracle machines, online computing, and three displacements in computability theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.
The application of algorithmic information theory to noisy patterned strings.Sean Devine - 2006 - Complexity 12 (2):52-58.
Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.
Towards a stable definition of program-size complexity.Hector Zenil - unknown
Review of Computability: Turing, Gödel, Church, and Beyond. [REVIEW]Andrew Arana - 2015 - Notre Dame Philosophical Reviews 3 (20).

Analytics

Added to PP
2016-06-30

Downloads
19 (#781,160)

6 months
5 (#638,139)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Systems of logic based on ordinals..Alan Turing - 1939 - London,: Printed by C.F. Hodgson & son.
Systems of Logic Based on Ordinals.Andrzej Mostowski - 1939 - Journal of Symbolic Logic 4 (3):128-129.
On the Computational Complexity of Algorithms.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):120-121.
The Universal Computer. The Road from Leibniz to Turing.Martin Davis - 2001 - Bulletin of Symbolic Logic 7 (1):65-66.

View all 6 references / Add more references