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)

Odifreddi, P.

Editore: North Holland, 1999
ISBN 10: 044450205X / ISBN 13: 9780444502056
Usato / Hardcover / Quantità: 1
Da Book Deals (Lewiston, NY, U.S.A.)
Copie del libro da altre librerie
Mostra tutte le  copie di questo libro
Aggiungere al carrello
Prezzo: EUR 218,53
Convertire valuta
Spedizione: EUR 0,00
In U.S.A.
Destinazione, tempi e costi

Lista dei preferiti


Dati bibliografici

Titolo: Classical Recursion Theory: The Theory of ...

Casa editrice: North Holland

Data di pubblicazione: 1999

Legatura: Hardcover

Condizione libro: Used


This Book is in Good Condition. Clean Copy With Light Amount of Wear. 100% Guaranteed. Summary: Preface. Introduction. Theories of Recursive functions. Hierarchies of recursive functions. Recursively enumerable sets. Recursively enumerable degrees. Limit sets. Arithmetical sets. Arithmetical degrees. Enumeration degrees. Bibliography. Notation index. Subject index. Codice inventario libreria ABE_book_usedgood_044450205X

Su questo libro:

Book ratings provided by GoodReads):
4,25 valutazione media
(4 valutazioni)

Riassunto: 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 "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Info su libreria e pagamento

Metodi di pagamento

La libreria accetta i seguenti metodi di pagamento:

  • American Express
  • Carte Bleue
  • Mastercard
  • Visa

[Cercare nel catalogo della libreria]

[Tutti i libri della libreria]

[Fare una domanda alla libreria]

Libreria: Book Deals
Indirizzo: Lewiston, NY, U.S.A.

Libreria AbeBooks dal: 7 maggio 2014
Valutazione libreria: 4 stelle

Condizioni di vendita:

We guarantee the condition of every book as it's described on the AbeBooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind
about a book that you've ordered, please use the Ask bookseller a question link
to contact us and we'll respond within 2 business days.

Condizioni di spedizione:

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.