Hierarchy of turing degrees
Uiterlijk 2 november in huis
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
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.
- 1 Bekijk alle specificaties
Taal: en
Bindwijze: Paperback
Oorspronkelijke releasedatum: 16 juni 2020
Aantal pagina's: 240
Illustraties: Nee
Hoofdauteur: Rod Downey
Tweede Auteur: Noam Greenberg
Hoofduitgeverij: Princeton University Press
Extra groot lettertype: Nee
Product breedte: 156 mm
Product lengte: 235 mm
Studieboek: Ja
Verpakking breedte: 156 mm
Verpakking hoogte: 15 mm
Verpakking lengte: 235 mm
Verpakkingsgewicht: 0.17 kg
EAN: 9780691199665