Classical Recursion Theory - Couverture rigide

Odifreddi, P.

9780444502056: Classical Recursion Theory

Couverture rigide

ISBN 10 : 044450205X ISBN 13 : 9780444502056

Editeur : North-Holland, 1999

Afficher les exemplaires de cette �dition comportant l?ISBN

0 D'occasion

8 Neuf

De EUR 143

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.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

Pr�sentation de l'�diteur

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.

Revue de presse

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

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteur: North-Holland
Date d'�dition: 1999
Langue: anglais
ISBN 10: 044450205X
ISBN 13: 9780444502056
Reliure: Reli�
Nombre de pages: 966
Coordonn�es du fabricant: non disponible

Acheter neuf

Afficher cet article

EUR 143

Autre devise

EUR 11 exp�dition depuis Allemagne vers France

Destinations, frais et d�lais

Ajouter au panier

R�sultats de recherche pour Classical Recursion Theory

Image fournie par le vendeur

Classical Recursion Theory, Volume II

P. Odifreddi

Edit� par Elsevier Science & Technology, North Holland, 1999

ISBN 10 : 044450205X ISBN 13 : 9780444502056

Neuf Buch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. Etat : 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. N� de r�f. du vendeur 9780444502056

Contacter le vendeur

Acheter neuf

EUR 143

Autre devise

Frais de port : EUR 11

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers, Vol. 2 (Studies in Logic and the Foundations of Mathematics, Vol. 143)

P. Odifreddi

Edit� par North-Holland, 1999

ISBN 10 : 044450205X ISBN 13 : 9780444502056

Neuf Couverture rigide

Vendeur : Revaluation Books, Exeter, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Hardcover. Etat : Brand New. 1st edition. 966 pages. 9.25x7.00x2.00 inches. In Stock. N� de r�f. du vendeur __044450205X

Contacter le vendeur

Acheter neuf

EUR 156,31

Autre devise

Frais de port : EUR 11,59

De Royaume-Uni vers France

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Classical Recursion Theory, Volume II

P. Odifreddi

Edit� par Elsevier Science & Technology, North Holland, 1999

ISBN 10 : 044450205X ISBN 13 : 9780444502056

Neuf Couverture rigide

impression � la demande

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. Etat : 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. N� de r�f. du vendeur 9780444502056

Contacter le vendeur