Stock photo
Stock photo
Lecture Notes in Logic Ser.: Abstract Recursion and Intrinsic Complexity by Yiannis N. Moschovakis (2018, Hardcover)
B
Books From California (164502)
99.4% positive feedback
Price:
US $75.30
ApproximatelyPHP 4,206.33
+ $19.95 shipping
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherCambridge University Press
ISBN-10110841558X
ISBN-139781108415583
eBay Product ID (ePID)11038540125
Product Key Features
Number of Pages250 Pages
LanguageEnglish
Publication NameAbstract Recursion and Intrinsic Complexity
SubjectAlgebra / General, Logic, Set Theory
Publication Year2018
TypeTextbook
Subject AreaMathematics
AuthorYiannis N. Moschovakis
SeriesLecture Notes in Logic Ser.
FormatHardcover
Dimensions
Item Height0.7 in
Item Weight16.7 Oz
Item Length9.3 in
Item Width6.2 in
Additional Product Features
Intended AudienceScholarly & Professional
LCCN2018-051435
Dewey Edition23
Reviews'... 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
Series Volume NumberSeries Number 48
IllustratedYes
Dewey Decimal518.1
Table Of ContentIntroduction; 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.
SynopsisThis 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.
LC Classification NumberQA9.58
Be the first to write a review
