Abstract Recursion and Intrinsic Complexity by Yiannis N Moschovakis
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.-
Effective Mathematics of the Uncountable
-
Set Theory, Arithmetic, and Foundations of Mathematics
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
-
Games, Scales and Suslin Cardinals
-
Large Cardinals, Determinacy and Other Topics
-
Logic Colloquium 2007
-
Complexity of Infinite-Domain Constraint Satisfaction
-
Lectures on Infinitary Model Theory
-
Logic and Algebraic Structures in Quantum Computing
-
Ordinal Definability and Recursion Theory
-
Logic Colloquium 2005
-
Homogeneous Ordered Graphs, Metrically Homogeneous Graphs, and Beyond: Volume 2, 3-Multi-graphs and 2-Multi-tournaments
-
Homogeneous Ordered Graphs, Metrically Homogeneous Graphs, and Beyond: Volume 1, Ordered Graphs and Distanced Graphs
-
Stable Domination and Independence in Algebraically Closed Valued Fields
-
A Comparison Process for Mouse Pairs
-
Recursion Theory
-
Descriptive Set Theory and Forcing
-
A General Algebraic Semantics for Sentential Logics
-
Bounded Variable Logics and Counting
-
Model Theory of Fields
-
Aspects of Incompleteness
-
Logic Colloquium '95
-
Logic Colloquium '90
-
Fine Structure and Iteration Trees
-
Logic Colloquium '96
-
The Core Model Iterability Problem
-
Quantifiers, Propositions and Identity
-
A Framework for Priority Arguments
-
Kurt Godel
-
A Guide to NIP Theories
-
The Cabal Seminar 4 Volume Hardback Set
-
The Largest Suslin Axiom
-
A Course in Model Theory
-
Simple Theories and Hyperimaginaries
-
Wadge Degrees and Projective Ordinals
' the author presents basic methods, approaches and results of the theory of abstract (rst-order) recursion and its relevance to the foundations of the theory of algorithms and computational complexity ' Marat MArslanov, Mathematical Reviews Clippings
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.
| SKU | Unavailable |
| ISBN 13 | 9781108415583 |
| ISBN 10 | 110841558X |
| Title | Abstract Recursion and Intrinsic Complexity |
| Author | Yiannis N Moschovakis |
| Series | Lecture Notes In Logic |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Cambridge University Press |
| Year published | 2018-12-06 |
| Number of pages | 250 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |