Księgarnia naukowa
English Polski
On-line access

Bookstore

0.00 PLN
Bookshelf (0) 
Your bookshelf is empty
A Hierarchy of Turing Degrees

A Hierarchy of Turing Degrees

Authors
Publisher Princeton University Press
Year 01/06/2020
Edition First
Pages 240
Version paperback
Readership level College/higher education
Language English
ISBN 9780691199665
Categories Mathematical logic, Applied mathematics, Computer science
$86.35 (with VAT)
319.00 PLN / €70.66 / £60.92
Qty:
Delivery to United States

check shipping prices
Product available
Delivery 2 days
Add to bookshelf

Book description

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

We also recommend books

Strony www Białystok Warszawa
801 777 223