Abstract Recursion and Intrinsic Complexity
$365.61
- Hardcover
250 pages
- Release Date
6 December 2018
Summary
Unveiling Complexity: An Exploration of Abstract Recursion and Intrinsic Algorithm Limits
This book offers a comprehensive framework for analyzing algorithm complexity, targeting logicians, computer scientists, mathematicians, and philosophers intrigued by computation theory and its underpinnings. Designed for accessibility, it welcomes non-specialists to delve into the subject.
Part I serves as an approachable introduction to abstract recursion theory and i…
Book Details
| ISBN-13: | 9781108415583 |
|---|---|
| ISBN-10: | 110841558X |
| Series: | Lecture Notes in Logic |
| Author: | Yiannis N. Moschovakis |
| Publisher: | Cambridge University Press |
| Imprint: | Cambridge University Press |
| Format: | Hardcover |
| Number of Pages: | 250 |
| Release Date: | 6 December 2018 |
| Weight: | 470g |
| Dimensions: | 235mm x 157mm x 18mm |
What They're Saying
Critics Review
‘… the author presents basic methods, approaches and results of the theory of abstract (first-order) recursion and its relevance to the foundations of the theory of algorithms and computational complexity …’ Marat M. Arslanov, Mathematical Reviews Clippings
About The Author
Yiannis N. Moschovakis
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.
Returns
This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.