ISBN10: 044450205X, ISBN13: 9780444502056, [publisher: Elsevier Science & Technology] Hardcover Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
[Mishawaka, IN, U.S.A.] [Publication Year: 1999]

Elsevier , . Hardback. New. Elsevier ISBN 044450205X 9780444502056 [US]

ISBN10: 044450205X, ISBN13: 9780444502056, [publisher: North Holland] Hardcover New. In shrink wrap. Looks like an interesting title! 3.71
[LOS ANGELES, CA, U.S.A.] [Publication Year: 1999]

ISBN10: 044450205X, ISBN13: 9780444502056, [publisher: Elsevier Science] Hardcover nach der Bestellung gedruckt Neuware - Printed after ordering - Volume II of Classical Recursion Theory describes the universe from a local (bottom-upor synthetical) point of view, and covers the whole spectrum, from therecursive to the arithmetical sets.The first half of the book provides a detailed picture of the computablesets from the perspective of Theoretical Computer Science. Besides giving adetailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexityclasses, ranging from small time and space bounds to the elementary functions,with a particular attention to polynomial time and space computability. It alsodeals with primitive recursive functions and larger classes, which are ofinterest to the proof theorist. The second half of the book starts with the classical theory of recursivelyenumerable sets and degrees, which constitutes the core of Recursion orComputability Theory. Unlike other texts, usually confined to the Turingdegrees, the book covers a variety of other strong reducibilities, studyingboth their individual structures and their mutual relationships. The lastchapters extend the theory to limit sets and arithmetical sets. The volumeends with the first textbook treatment of the enumeration degrees, whichadmit a number of applications from algebra to the Lambda Calculus.The book ...