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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Search results for Abstract Recursion and Intrinsic Complexity (Lecture...
Stock Image
Abstract Recursion and Intrinsic Complexity: Series Number 48 (Lecture Notes in Logic, Series Number 48)
Seller: AwesomeBooks, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
hardcover. Condition: Very Good. Abstract Recursion and Intrinsic Complexity: Series Number 48 (Lecture Notes in Logic, Series Number 48) 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 # 7719-9781108415583
Buy Used
US$ 41.25
Shipping:
US$ 6.54
From United Kingdom to U.S.A.
Quantity: 2 available
Stock Image
Abstract Recursion and Intrinsic Complexity: Series Number 48 (Lecture Notes in Logic, Series Number 48)
Seller: Bahamut Media, Reading, United Kingdom
Seller rating 5 out of 5 stars
hardcover. Condition: Very Good. 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
Buy Used
US$ 41.25
Shipping:
US$ 9.14
From United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Abstract Recursion and Intrinsic Complexity (Lecture Notes in Logic, Series Number 48)
Published by
Cambridge University Press, 2019
ISBN 10: 110841558X
ISBN 13: 9781108415583
Used
Hardcover
Seller: Books From California, Simi Valley, CA, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: Good. Cover and edges may have some wear. Mild to Moderate creasing / bending to covers and pages. Seller Inventory # mon0003603988
Stock Image
Abstract Recursion and Intrinsic Complexity
Published by
Cambridge University Press, 2018
ISBN 10: 110841558X
ISBN 13: 9781108415583
New
Hardcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FM-9781108415583
Stock Image
Abstract Recursion and Intrinsic Complexity
Published by
Cambridge University Press, 2018
ISBN 10: 110841558X
ISBN 13: 9781108415583
New
Hardcover
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FM-9781108415583
Buy New
US$ 161.89
Shipping:
US$ 5.45
From United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Abstract Recursion and Intrinsic Complexity (Hardcover)
Published by
Cambridge University Press, Cambridge, 2018
ISBN 10: 110841558X
ISBN 13: 9781108415583
New
Hardcover
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. 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. The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes an accessible introduction to abstract recursion theory and contains over 250 problems. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781108415583
Stock Image
Abstract Recursion and Intrinsic Complexity
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 243 pages. 9.25x6.25x0.75 inches. In Stock. Seller Inventory # __110841558X
Buy New
US$ 170.40
Shipping:
US$ 13.10
From United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Abstract Recursion and Intrinsic Complexity
Published by
Cambridge University Press, 2019
ISBN 10: 110841558X
ISBN 13: 9781108415583
New
Hardcover
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: New. New copy - Usually dispatched within 4 working days. 518. Seller Inventory # B9781108415583
Buy New
US$ 167.71
Shipping:
US$ 20.87
From United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Abstract Recursion and Intrinsic Complexity (Hardcover)
Published by
Cambridge University Press, Cambridge, 2018
ISBN 10: 110841558X
ISBN 13: 9781108415583
New
Hardcover
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. 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. The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes an accessible introduction to abstract recursion theory and contains over 250 problems. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9781108415583
Buy New
US$ 169.32
Shipping:
US$ 48.47
From United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Abstract Recursion and Intrinsic Complexity
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes . Seller Inventory # 251536931