000			02966nam a22003738i 4500
001			CR9780511629167
003			UkCbUP
005			20200124160231.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			090918s1996||||enk o ||1 0|eng|d
020			_a9780511629167 (ebook)
020			_z9780521557368 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA9.6 _b.C66 1996
082	0	0	_a511.3/5 _220
245	0	0	_aComputability, enumerability, unsolvability : _bdirections in recursion theory / _cedited by S.B. Cooper, T.A. Slaman, S.S. Wainer.
264		1	_aCambridge : _bCambridge University Press, _c1996.
300			_a1 online resource (vii, 347 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aLondon Mathematical Society lecture note series ; _v224
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505	0		_aResource bounded genericity / K. Ambos-Spies -- On isolating r.e. and isolated d-r.e. degrees / M.M. Arslanov, S. Lempp and R.A. Shore -- A characterisation of the jumps of minimal degrees below 0' / S.B. Cooper -- Array nonrecursive degrees and genericity / R. Downey, C.G. Jockusch and M. Stob -- Dynamic properties of computably enumerable sets / L. Harrington and R.I. Soare -- Axioms for subrecursion theories / A.J. Heaton and S.S. Wainer -- On the [actual symbol not reproducible] -- theory of the factor lattice by the major subset relation / E. Herrmann -- Degrees of generic sets / M. Kumabe -- Embeddings into the recursively enumerable degrees / M. Lerman -- On a question of Brown and Simpson / M.E. Mytilinaios and T.A. Slaman -- Relativization of structures arising from computability theory / A. Nies -- A Hierarchy of domains with totality, but without density / D. Normann -- Inductive inference of total functions / P. Odifreddi.
520			_aThe 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.
650		0	_aRecursion theory.
700	1		_aCooper, S. B. _q(S. Barry), _eeditor.
700	1		_aSlaman, T. A. _q(Theodore Allen), _d1954- _eeditor.
700	1		_aWainer, S. S., _eeditor.
776	0	8	_iPrint version: _z9780521557368
830		0	_aLondon Mathematical Society lecture note series ; _v224.
856	4	0	_uhttps://doi.org/10.1017/CBO9780511629167
999			_c517614 _d517612