Computability, enumerability, unsolvability: directions in recursion theory

, & (eds.)
New York: Cambridge University Press (1996)
  Copy   BIBTEX

Abstract

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource for specialists and non-specialists alike.

Categories

Keywords

Reprint years

Call number

QA9.6.C66 1996

ISBN(s)

0521557364   9780521557368

Other Versions

No versions found

View all bargains

Buy this book

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,925

External links

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

Through your library

My notes

Chapters

Yates [1970], who obtained a low minimal degree as a corollary to his con.  (pages 81)of Minimal Degrees Below
Embeddings into the recursively enumerable degreesi.  (pages 185)Nsf Grant Dms92
Dynamic properties of computably enumerable sets.  (pages 224--105)Robert I. Soare
On isolating re and isolated dr. e. degrees.  (pages 224--61)Steffen Lemppl & Richard A. Shore
On the V3-Theory of the Factor Lattice by the Major Subset Relation.  (pages 224--139)Eberhard Herrmann
The Medvedev Lattice of Degrees of Difficulty.  (pages 224--289)Andrea Sorbi

Similar books and articles

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.
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. New York: Cambridge University Press. pp. 224--105.
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. New York: 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. New York: 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. New York: Cambridge University Press. pp. 224--61.
On the V3-Theory of the Factor Lattice by the Major Subset Relation.Eberhard Herrmann - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 224--139.
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. New York: Cambridge University Press. pp. 81.
Computability, enumerability, unsolvability, Directions in recursion theory, edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, London Mathematical Society lecture note series, no. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, vii + 347 pp. - Leo Harrington and Robert I. Soare, Dynamic properties of computably enumerable sets, Pp. 105–121. - Eberhard Herrmann, On the ∀∃-theory of the factor lattice by the major subset relation, Pp. 139–166. - Manuel Lerman, Embeddings into the recursively enumerable degrees, Pp. 185–204. - Xiaoding Yi, Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees, Pp. 313–331. - André Nies, Relativization of structures arising from computability theory. Pp. 219–232. - Klaus Ambos-Spies, Resource-bounded genericity. Pp. 1–59. - Rod Downey, Carl G. Jockusch, and Michael Stob. Array nonrecursive degrees and genericity, Pp. 93–104. - Masahiro Kumabe, Degrees of generic sets, Pp. 167–183. [REVIEW]C. T. Chong - 1999 - Journal of Symbolic Logic 64 (3):1362-1365.
Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.

Analytics

Added to PP
2009-01-28

Downloads
39 (#550,444)

6 months
4 (#1,231,713)

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