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 ...
Read More
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.
Read Less
Add this copy of Abstract Recursion and Intrinsic Complexity (Lecture to cart. $72.34, good condition, Sold by Books From California rated 4.0 out of 5 stars, ships from Simi Valley, CA, UNITED STATES, published 2019 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Cover and edges may have some wear. Mild to Moderate creasing / bending to covers and pages. Very Clean Copy-Over 500, 000 Internet Orders Filled.
Add this copy of Abstract Recursion and Intrinsic Complexity to cart. $131.75, new condition, Sold by Books2anywhere rated 5.0 out of 5 stars, ships from Fairford, GLOUCESTERSHIRE, UNITED KINGDOM, published 2018 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Please note we cannot offer an expedited shipping service from the UK.
Add this copy of Abstract Recursion and Intrinsic Complexity to cart. $138.59, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2018 by Cambridge University Press.
Add this copy of Abstract Recursion and Intrinsic Complexity to cart. $139.98, new condition, Sold by Paperbackshop International rated 5.0 out of 5 stars, ships from Fairford, GLOS, UNITED KINGDOM, published 2018 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Please note we cannot offer an expedited shipping service from the UK.
Add this copy of Abstract Recursion and Intrinsic Complexity to cart. $146.22, new condition, Sold by Paperbackshop rated 4.0 out of 5 stars, ships from Bensenville, IL, UNITED STATES, published 2018 by Cambridge University Press.
Add this copy of Abstract Recursion and Intrinsic Complexity to cart. $156.84, new condition, Sold by Booksplease rated 3.0 out of 5 stars, ships from Southport, MERSEYSIDE, UNITED KINGDOM, published 2018 by Cambridge University Press.
