Author Description

<p>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.<br><br>In <i>A Hierarchy of Turing Degrees</i>, 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.<br><br>Blending traditional and modern research results in computability theory, <i>A Hierarchy of Turing Degrees </i>establishes novel directions in the field.</p>