Computability of Recursive Functions

&
Journal of Symbolic Logic 32 (1):122-123 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271277

Links

PhilArchive



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

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

Review: J. C. Shepherdson, H. E. Sturgis, Computability of Recursive Functions. [REVIEW]Gunter Asser - 1967 - Journal of Symbolic Logic 32 (1):122-123.
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
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 Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space.Qing Zhou - 1996 - Mathematical Logic Quarterly 42 (1):379-409.
Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers.Dimiter Skordev - 2002 - Mathematical Logic Quarterly 48 (S1):91-106.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Uniformly reflexive structures: towards an abstract theory of computability.Eric Gerhardt Wagner - 1963 - [New York: [S.N.].
Effective Structures.Alexandra A. Soskova - 1997 - Mathematical Logic Quarterly 43 (2):235-250.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Order‐free Recursion on the Real Numbers.Vasco Brattka - 1997 - Mathematical Logic Quarterly 43 (2):216-234.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW]C. E. M. Yates - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW]Clifford Spector - 1959 - Journal of Symbolic Logic 24 (1):70-70.
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.

Analytics

Added to PP
2015-02-05

Downloads
44 (#361,171)

6 months
8 (#361,319)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Representation and Invariance of Scientific Structures.Patrick Suppes - 2002 - CSLI Publications (distributed by Chicago University Press).
Against Structuralist Theories of Computational Implementation.Michael Rescorla - 2013 - British Journal for the Philosophy of Science 64 (4):681-707.
What is a Computer? A Survey.William J. Rapaport - 2018 - Minds and Machines 28 (3):385-426.
Are Computational Transitions Sensitive to Semantics?Michael Rescorla - 2012 - Australasian Journal of Philosophy 90 (4):703-721.

View all 13 citations / Add more citations

References found in this work

No references found.

Add more references