000			02130nam a22003978a 4500
001			CR9780511629167
003			UkCbUP
005			20160624102301.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			090918s1996||||enk s ||1 0|eng|d
020			_a9780511629167 (ebook)
020			_z9780521557368 (paperback)
040			_aUkCbUP _cUkCbUP _erda
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.
260		1	_aCambridge : _bCambridge University Press, _c1996.
264		1	_aCambridge : _bCambridge University Press, _c1996.
300			_a1 online resource (356 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	0		_aLondon Mathematical Society Lecture Note Series ; _vno. 224
500			_aTitle from publisher's bibliographic system (viewed on 16 Oct 2015).
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., _eeditor of compilation.
700	1		_aSlaman, T. A., _eeditor of compilation.
700	1		_aWainer, S. S., _eeditor of compilation.
776	0	8	_iPrint version: _z9780521557368
786			_dCambridge
830		0	_aLondon Mathematical Society Lecture Note Series ; _vno. 224.
856	4	0	_uhttp://dx.doi.org/10.1017/CBO9780511629167
942			_2EBK12192 _cEBK
999			_c41486 _d41486