A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability / Rod Downey, Noam Greenberg.
By: Downey, R. G. (Rod G.) [author.]
.
Contributor(s): Greenberg, Noam [author.].
Material type: 
BookSeries: Annals of mathematics studies: no. 206, 385.Publisher: Princeton, New Jersey : Princeton University Press, 2020Description: 1 online resource : illustrations.Content type: text Media type: computer Carrier type: online resourceISBN: 9780691200217; 0691200211.Subject(s): Unsolvability (Mathematical logic) | Computable functions | Recursively enumerable sets | Non-r�esolubilit�e (Logique math�ematique) | Fonctions calculables | Ensembles r�ecursivement �enum�erables | MATHEMATICS -- Logic | Computable functions | Recursively enumerable sets | Unsolvability (Mathematical logic)Genre/Form: Electronic books.Additional physical formats: Print version:: Hierarchy of Turing degrees.DDC classification: 511.3 Online resources: Click here to access online Summary: 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. This book introduces 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. The book presents 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, the book establishes novel directions in the field.
Print version record
Includes bibliographical references
Series: Annals of Mathematics Studies, 385--online resource web page. Annals of Mathematics Studies Number 206--PDF title page
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. This book introduces 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. The book presents 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, the book establishes novel directions in the field.
IEEE IEEE Xplore Princeton University Press eBooks Library
There are no comments for this item.