A Hierarchy of Turing Degrees - Downey, Rod; Greenberg, Noam
205,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
payback
103 °P sammeln
  • Gebundenes Buch

"This book presents new results in computability theory, a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field's connections with disparate areas of mathematical logic and mathematics more generally have grown deeper, and now have a variety of applications in topology, group theory, and other subfields. This monograph establishes new directions in the field, blending classic results with modern research areas such as algorithmic randomness. The significance of the book lies not only in the depth of the results contained therein,…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
"This book presents new results in computability theory, a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field's connections with disparate areas of mathematical logic and mathematics more generally have grown deeper, and now have a variety of applications in topology, group theory, and other subfields. This monograph establishes new directions in the field, blending classic results with modern research areas such as algorithmic randomness. The significance of the book lies not only in the depth of the results contained therein, but also in the fact that the notions the authors introduce allow them to unify results from several subfields of computability theory"--
Autorenporträt
Rod Downey and Noam Greenberg are professors of mathematics at Victoria University of Wellington in New Zealand. Downey is the coauthor of Parameterized Complexity, Algorithmic Randomness and Complexity, and Fundamentals of Parameterized Complexity. Greenberg is the author of The Role of True Finiteness in the Admissible Recursively Enumerable Degrees.