An early history of recursive functions and computability from Gödel to Turing

History and Philosophy of Logic 33 (2):191 - 191 (2012)
  Copy   BIBTEX

Abstract

History and Philosophy of Logic, Volume 33, Issue 2, Page 191, May 2012

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Godel on computability.W. Sieg - 2006 - Philosophia Mathematica 14 (2):189-207.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
An invariance notion in recursion theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.

Analytics

Added to PP
2012-01-11

Downloads
38 (#408,165)

6 months
8 (#352,434)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references