Description: Abstract Recursion and Intrinsic Complexity: 48 (Lecture Notes in Logic, Series Number 48)Yiannis N. Moschovakis Cambridge University Press Hardcover Unused and unread, serious issue such as a tear or bumps. Creased rear cover corner. Stamped 'damaged' by publisher to a non-text page. EAN: 9781108415583 Published: 06/12/2018 Language: English 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. Introduction 1. Preliminaries Part I. Abstract (First Order) Recursion 2. Recursive (McCarthy) programs 3. Complexity theory for recursive programs Part II. Intrinsic Complexity 4. The homomorphism method 5. Lower bounds from Presburger primitives 6. Lower bounds from division with remainder 7. Lower bounds from division and multiplication 8. Non-uniform complexity in N 9. Polynomial nullity (0-testing) References Symbol index General index. DispatchIn stock here - same-day dispatch from England. My SKU: 3283793RefundsNo-hassle refunds are always available if your book is not as expected.Terms and Conditions of SaleSorry - no collections. All sales are subject to extended Terms and Conditions of Sale as well as the Return Policy and Payment Instructions. Visit my eBay Store for details andmany more books. Template layout and design, "JNC Academic Books", "needbooks", Copyright © JNC INC. Designated trademarks, layouts and brands are the property of their respective owners. All Rights Reserved.
Price: 12.59 GBP
Location: Welwyn Garden City
End Time: 2024-12-08T19:26:20.000Z
Shipping Cost: 125.56 GBP
Product Images
Item Specifics
Return postage will be paid by: Buyer
Returns Accepted: Returns Accepted
After receiving the item, your buyer should cancel the purchase within: 30 days
Return policy details:
Number of Pages: 250 Pages
Publication Name: Abstract Recursion and Intrinsic Complexity
Language: English
Publisher: Cambridge University Press
Item Height: 235 mm
Subject: Mathematics
Publication Year: 2018
Type: Textbook
Item Weight: 470 g
Author: Yiannis N. Moschovakis
Item Width: 157 mm
Series: Lecture Notes in Logic
Format: Hardcover