Abstract Recursion and Intrinsic Complexity: Series Number 48 (Lecture Notes in Logic, Series Number 48)

-

ISBN 10: 110841558X / ISBN 13: 9781108415583

Published by - -, 2019

About this Item

This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping.

Seller Inventory # 6545-9781108415583

Bibliographic Details

• Title: Abstract Recursion and Intrinsic Complexity: Series Number 48 (Lecture Notes in Logic, Series Number 48)
• Publisher: - -
• Publication Date: 2019
• Language: English
• ISBN 10: 110841558X
• ISBN 13: 9781108415583
• Binding: hardcover
• Condition: Very Good

About this title

Synopsis

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 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.

About the Author

Yiannis N. Moschovakis is Professor Emeritus and Distinguished Research Professor of Mathematics at the University of California, Los Angeles, and Professor Emeritus at the University of Athens. Among his many professional commendations he is a Fellow of the AMS and a corresponding member of the Academy of Athens. He has received Guggenheim and Sloan Fellowships and has been an invited speaker at the International Congress of Mathematicians. Professor Moschovakis has worked primarily in the theory of recursion, descriptive set theory and the foundations of the theory of algorithms and computation.