Volume II of Classical Recursion Theory describes the universe from a local (bottom-up
or synthetical) point of view, and covers the whole spectrum, from the
recursive to the arithmetical sets.
The first half of the book provides a detailed picture of the computable
sets from the perspective of Theoretical Computer Science. Besides giving a
detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity
classes, ranging from small time and space bounds to the elementary functions,
with a particular attention to polynomial time and space computability. It also
deals with primitive recursive functions and larger classes, which are of
interest to the proof theorist.
The second half of the book starts with the classical theory of recursively
enumerable sets and degrees, which constitutes the core of Recursion or
Computability Theory. Unlike other texts, usually confined to the Turing
degrees, the book covers a variety of other strong reducibilities, studying
both their individual structures and their mutual relationships. The last
chapters extend the theory to limit sets and arithmetical sets. The volume
ends with the first textbook treatment of the enumeration degrees, which
admit a number of applications from algebra to the Lambda Calculus.
The book is a valuable source of information for anyone interested in
Complexity and Computability Theory. The student will appreciate the detailed
but informal account of a wide variety of basic topics, while the specialist
will find a wealth of material sketched in exercises and asides. A massive
bibliography of more than a thousand titles completes the treatment on the
historical side.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Rodney G. Downey
The scope of the material is amazing. For instance, I can think of no other book with a treatment of w-REA sets inductive reference, and models of lambda calculus! This is especially gratifying in a world of continuing mathematical fragmentation.
Mathematical Reviews
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 11,00 per la spedizione da Germania a Italia
Destinazione, tempi e costiDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 is a valuable source of information for anyone interested inComplexity and Computability Theory. The student will appreciate the detailedbut informal account of a wide variety of basic topics, while the specialistwill find a wealth of material sketched in exercises and asides. A massivebibliography of more than a thousand titles completes the treatment on thehistorical side. Englisch. Codice articolo 9780444502056
Quantità: 2 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. 1st edition. 966 pages. 9.25x7.00x2.00 inches. In Stock. Codice articolo __044450205X
Quantità: 2 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Buch. Condizione: Neu. 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 is a valuable source of information for anyone interested inComplexity and Computability Theory. The student will appreciate the detailedbut informal account of a wide variety of basic topics, while the specialistwill find a wealth of material sketched in exercises and asides. A massivebibliography of more than a thousand titles completes the treatment on thehistorical side. Codice articolo 9780444502056
Quantità: 2 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. Codice articolo 262073172
Quantità: 1 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Codice articolo 6823307
Quantità: 1 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. Codice articolo 182073182
Quantità: 1 disponibili
Da: Chiron Media, Wallingford, Regno Unito
Hardcover. Condizione: New. Codice articolo 6666-ELS-9780444502056
Quantità: Più di 20 disponibili
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Condizione: new. Questo è un articolo print on demand. Codice articolo dee6db817e1a874056ac21a29cc696be
Quantità: Più di 20 disponibili