Articoli correlati a Classical Recursion Theory, Volume II: 2
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.
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.
Recensione:
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
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.
- EditoreNorth Holland
- Data di pubblicazione1999
- ISBN 10 044450205X
- ISBN 13 9780444502056
- RilegaturaCopertina rigida
- Numero edizione1
- Numero di pagine949
Compra nuovo
Scopri di più su questo articolo
EUR 143,00
Spese di spedizione:
EUR 23,00
Da: Germania a: U.S.A.
I migliori risultati di ricerca su AbeBooks
Immagini fornite dal venditore
Classical Recursion Theory, Volume II
Editore:
ELSEVIER SCIENCE & TECHNOLOGY Sep 1999
(1999)
ISBN 10: 044450205X
ISBN 13: 9780444502056
Nuovo
Buch
Quantità: 2
Da:
Valutazione libreria
Descrizione libro 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. 949 pp. Englisch. Codice articolo 9780444502056
Compra nuovo
EUR 143,00
Convertire valuta
Foto dell'editore
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers, Vol. 2 (Studies in Logic and the Foundations of Mathematics, Vol. 143)
Da:
Valutazione libreria
Descrizione libro Hardcover. Condizione: Brand New. 1st edition. 966 pages. 9.25x7.00x2.00 inches. In Stock. Codice articolo __044450205X
Compra nuovo
EUR 157,29
Convertire valuta
Immagini fornite dal venditore
CLASSICAL RECURSION THEORY V02
Editore:
Elsevier Science & Technology|North Holland
(1999)
ISBN 10: 044450205X
ISBN 13: 9780444502056
Nuovo
Rilegato
Quantità: > 20
Da:
Valutazione libreria
Descrizione libro Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. This book presents a detailed picture of the computable sets from the perspective of theoretical comput. Codice articolo 594685153
Compra nuovo
EUR 135,64
Convertire valuta
Immagini fornite dal venditore
Classical Recursion Theory, Volume II : Volume 143
Editore:
Elsevier Science
(1999)
ISBN 10: 044450205X
ISBN 13: 9780444502056
Nuovo
Rilegato
Quantità: 2
Da:
Valutazione libreria
Descrizione libro 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
Compra nuovo
EUR 156,95
Convertire valuta
Foto dell'editore
Classical Recursion Theory, Volume II: Vol 2 (Studies in Logic and the Foundations of Mathematics)
Editore:
North Holland 1999-09-07
(1999)
ISBN 10: 044450205X
ISBN 13: 9780444502056
Nuovo
Rilegato
Quantità: > 20
Da:
Valutazione libreria
Descrizione libro Hardcover. Condizione: New. Codice articolo 6666-ELS-9780444502056
Compra nuovo
EUR 199,45
Convertire valuta
Foto dell'editore
Classical Recursion Theory, Volume II: Volume 143 (Studies in Logic and the Foundations of Mathematics)
Print on Demand
Da:
Valutazione libreria
Descrizione libro Condizione: new. Questo è un articolo print on demand. Codice articolo dee6db817e1a874056ac21a29cc696be
Compra nuovo
EUR 211,92
Convertire valuta
Foto dell'editore
Classical Recursion Theory, Vol. 2
Da:
Valutazione libreria
Descrizione libro Condizione: New. Codice articolo 262073172
Compra nuovo
EUR 220,05
Convertire valuta
Foto dell'editore
CLASSICAL RECURSION THEORY: THE
Da:
Valutazione libreria
Descrizione libro Condizione: New. New. In shrink wrap. Looks like an interesting title! 3.71. Codice articolo Q-044450205X
Compra nuovo
EUR 225,91
Convertire valuta
Foto dell'editore
Classical Recursion Theory, Vol. 2
Da:
Valutazione libreria
Descrizione libro Condizione: New. Codice articolo 6823307
Compra nuovo
EUR 237,25
Convertire valuta
Foto dell'editore
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers, Vol. 2 (Studies in Logic and the Foundations of Mathematics, Vol. 143) (Volume 143)
Da:
Valutazione libreria
Descrizione libro Condizione: New. Book is in NEW condition. Codice articolo 044450205X-2-1
Compra nuovo
EUR 244,93
Convertire valuta