000			04275cam a2200745 i 4500
001			on1151198376
003			OCoLC
005			20220908100211.0
006			m o d
007			cr cnu---unuuu
008			200509s2020 njua ob 000 0 eng d
040			_aEBLCP _beng _erda _epn _cEBLCP _dOCLCO _dN$T _dJSTOR _dOCLCF _dUBY _dCUV _dBNG _dYDX _dOH1 _dIEEEE _dOCLCO _dSFB _dOCLCO _dOCLCQ
019			_a1159141858
020			_a9780691200217 _q(electronic bk.)
020			_a0691200211 _q(electronic bk.)
020			_z9780691199658 _q(hardcover)
020			_z0691199655 _q(hardcover)
020			_z9780691199665 _q(paperback)
020			_z0691199663 _q(paperback)
029	1		_aAU@ _b000067499835
035			_a(OCoLC)1151198376 _z(OCoLC)1159141858
037			_a22573/ctvssq932 _bJSTOR
037			_a9452519 _bIEEE
050		4	_aQA9.63 _b.D69 2020
072		7	_aMAT _x018000 _2bisacsh
072		7	_aCOM _x014000 _2bisacsh
072		7	_aMAT _x003000 _2bisacsh
082	0	4	_a511.3 _223
049			_aMAIN
100	1		_aDowney, R. G. _q(Rod G.), _eauthor. _965523
245	1	2	_aA hierarchy of Turing degrees : _ba transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability / _cRod Downey, Noam Greenberg.
264		1	_aPrinceton, New Jersey : _bPrinceton University Press, _c2020
300			_a1 online resource : _billustrations
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aAnnals of Mathematics Studies ; _vv. 385
490	1		_aAnnals of mathematics studies ; _vnumber 206
588	0		_aPrint version record
504			_aIncludes bibliographical references
500			_aSeries: Annals of Mathematics Studies, 385--online resource web page. Annals of Mathematics Studies Number 206--PDF title page
520			_aComputability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields. This book introduces a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. The book presents numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers. Blending traditional and modern research results in computability theory, the book establishes novel directions in the field.
590			_aIEEE _bIEEE Xplore Princeton University Press eBooks Library
650		0	_aUnsolvability (Mathematical logic) _965524
650		0	_aComputable functions. _965525
650		0	_aRecursively enumerable sets. _965526
650		6	_aNon-r�esolubilit�e (Logique math�ematique) _965527
650		6	_aFonctions calculables. _965528
650		6	_aEnsembles r�ecursivement �enum�erables. _965529
650		7	_aMATHEMATICS _xLogic. _2bisacsh _965530
650		7	_aComputable functions _2fast _0(OCoLC)fst00871985 _965525
650		7	_aRecursively enumerable sets _2fast _0(OCoLC)fst01091988 _965526
650		7	_aUnsolvability (Mathematical logic) _2fast _0(OCoLC)fst01162046 _965524
655		4	_aElectronic books. _93294
700	1		_aGreenberg, Noam, _d1974- _eauthor. _965531
776	0	8	_iPrint version: _aDowney, R.G. (Rod G.). _tHierarchy of Turing degrees. _dPrinceton, New Jersey : Princeton University Press, 2020 _z9780691199658 _w(DLC) 2019052456 _w(OCoLC)1145894088
830		0	_aAnnals of mathematics studies ; _vno. 206, 385. _965532
856	4	0	_uhttps://ieeexplore.ieee.org/servlet/opac?bknumber=9452519
938			_aAskews and Holts Library Services _bASKH _nAH37347562
938			_aProQuest Ebook Central _bEBLB _nEBL6173881
938			_aEBSCOhost _bEBSC _n2324246
938			_aYBP Library Services _bYANK _n16584674
942			_cEBK
994			_a92 _bINTKS
999			_c81475 _d81475