000			02199nam a22003498i 4500
001			CR9781108234238
003			UkCbUP
005			20200124160158.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			161129s2019||||enk o ||1 0|eng|d
020			_a9781108234238 (ebook)
020			_z9781108415583 (hardback)
040			_aUkCbUP _beng _erda _cUkCbUP
050		4	_aQA9.6 _b.M67 2019
082	0	4	_a511.3 _223
100	1		_aMoschovakis, Yiannis N., _eauthor.
245	1	0	_aAbstract recursion and intrinsic complexity / _cYiannis N. Moschovakis.
264		1	_aCambridge : _bCambridge University Press, _c2019.
300			_a1 online resource (vii, 243 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aLecture notes in logic ; _v48
500			_aTitle from publisher's bibliographic system (viewed on 15 Nov 2018).
520			_aThis book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems.
650		0	_aRecursion theory.
650		0	_aInduction (Mathematics)
776	0	8	_iPrint version: _z9781108415583
830		0	_aLecture notes in logic ; _v48.
856	4	0	_uhttps://doi.org/10.1017/9781108234238
999			_c514615 _d514613