Martin Davis: "Computability and Unsolvability" [Book Review]

Ratio (Misc.) 4 (1):64 (1962)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
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: Martin Davis, Computability & Unsolvability; Martin Davis, Hilbert's Tenth Problem is Unsolvable. [REVIEW]H. B. Enderton - 1987 - Journal of Symbolic Logic 52 (1):294-294.
Review: Martin Davis, Computability & Unsolvability. [REVIEW]Clifford Spector - 1958 - Journal of Symbolic Logic 23 (4):432-433.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Review: Clifford Spector, On Degrees of Recursive Unsolvability. [REVIEW]Martin Davis - 1957 - Journal of Symbolic Logic 22 (4):374-375.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Review: Richard Montague, Towards a General Theory of Computability. [REVIEW]Martin Davis - 1964 - Journal of Symbolic Logic 29 (1):63-64.
Computability, Complexity, and Languages. Fundamentals of Theoretical Computer Science.Martin D. Davis & Elaine J. Weyuker - 1987 - Journal of Symbolic Logic 52 (1):293-294.
Book review: Melvin Fitting. Computability theory, semantics, and logic programming. [REVIEW]Martin Davis - 1990 - Notre Dame Journal of Formal Logic 31 (3):485-486.
Embeddings into the recursively enumerable degreesi.Nsf Grant Dms92 - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press. pp. 185.
The Medvedev Lattice of Degrees of Difficulty.Andrea Sorbi - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press. pp. 224--289.
On isolating re and isolated dr. e. degrees.Steffen Lemppl & Richard A. Shore - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press. pp. 224--61.
Dynamic properties of computably enumerable sets.Robert I. Soare - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press. pp. 224--105.
Review: S. B. Cooper, T. A. Slaman, S. S. Wainer, Computability, Enumerability, Unsolvability, Directions in Recursion Theory. [REVIEW]C. T. Chong - 1999 - Journal of Symbolic Logic 64 (3):1362-1365.
SB Cooper, TA Slaman, and SS Wainer, eds. Computability, Enumerability, Unsolvability: Directions in Recursion Theory.R. Downey - 1997 - Journal of Logic Language and Information 6:107-109.
Yates [1970], who obtained a low minimal degree as a corollary to his con.of Minimal Degrees Below - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press. pp. 81.

Analytics

Added to PP
2015-02-04

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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