Abstract Recursion and Intrinsic Complexity cover image

Abstract Recursion and Intrinsic Complexity

By Yiannis N. Moschovakis
Cambridge University Press / Association for Symbolic Logic


This 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<span class='showMoreLessContentElement' style='display: none;'> 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.</span> <span class='showMoreLessControlElement showMoreLessInline'>&nbsp;<span>Read more...</span></span> </div>

Related books

Abstracts and the writing of abstracts
John M. Swales; Christine B. Feak
Abstracts and Abstracting. A Genre and Set of Skills for the Twenty-First Century
Tibor Koltay (Auth.)
Catecholamine Research in the 21st Century. Abstracts and Graphical Abstracts, 10th International Catecholamine Symposium, 2012
Lee E. Eiden (Eds.)
Theses abstracts
El Hijo del León
Ibn Asad
Theses abstracts
Рекомендации по обучению в аспирантуре и подготовке диссертации (по экономическим наукам)
Кузовкина Т.А.
Theses abstracts
From Dissertation to Book
William Germano