ABE-IPSABE HOLDINGABE BOOKS
English Polski
Dostęp on-line

Książki

0.00 PLN
Schowek (0) 
Schowek jest pusty
A Hierarchy of Turing Degrees

A Hierarchy of Turing Degrees

Autorzy
Wydawnictwo Princeton University Press
Data wydania 01/06/2020
Wydanie Pierwsze
Liczba stron 240
Forma publikacji książka w miękkiej oprawie
Język angielski
ISBN 9780691199665
Kategorie Logika matematyczna
319.00 PLN (z VAT)
$71.76 / €68.39 / £59.37 /
Produkt dostępny
Dostawa 2 dni
Ilość
Do schowka

Opis książki

Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields.

In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.

Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.

A Hierarchy of Turing Degrees

Polecamy również książki

Strony www Białystok Warszawa
801 777 223