Filter by
Filters

Publication date

1971 year - 2024 year

Author

In stock

Price

0.00 zł - 20,627.00 zł

Delivery time

2 days - 30 days

Publisher

Mathematical logic

A Hierarchy of Turing Degrees

Author: Noam Greenberg
Rod Downey
Publishing date: 2020
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
319.00 zł