Classical Recursion Theory, Volume II / Najlacnejšie knihy
Classical Recursion Theory, Volume II

Kod: 04610752

Classical Recursion Theory, Volume II

Autor Piergiorgio Odifreddi

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 provide ... więcej

158.22


Na zamówienie
Wysyłamy za 3 - 5 dni
Dodaj do schowka

Zobacz książki o podobnej tematyce

Podaruj tę książkę jeszcze dziś
  1. Zamów książkę i wybierz "Wyślij jako prezent".
  2. Natychmiast wyślemy Ci bon podarunkowy, który możesz przekazać adresatowi prezentu.
  3. Książka zostanie wysłana do adresata, a Ty o nic nie musisz się martwić.

Dowiedz się więcej

Więcej informacji o Classical Recursion Theory, Volume II

Za ten zakup dostaniesz 394 punkty

Opis

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.

Szczegóły książki

Kategoria Książki po angielsku Mathematics & science Mathematics Mathematical foundations

158.22

Ulubione w innej kategorii



Osobní odběr Bratislava a 2642 dalších

Copyright ©2008-24 najlacnejsie-knihy.sk Wszelkie prawa zastrzeżonePrywatnieCookies


Konto: Logowanie
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Nákupní košík ( prázdný )

Nakupte za 59,99 € a
máte doručení zdarma.

Twoja lokalizacja: