A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability - Rilegato

Downey, Rod; Greenberg, Noam

 
9780691199658: A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability
Rilegato
ISBN 10: 0691199655 ISBN 13: 9780691199658
Casa editrice: Princeton Univ Pr, 2020

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sull?autore

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Princeton Univ Pr
Data di pubblicazione
2020
Lingua
Inglese
ISBN 10 
0691199655
ISBN 13 
9780691199658
Rilegatura
Copertina rigida
Numero di pagine
222
Contatto del produttore
non disponibile
Persona responsabile
non disponibile

Altre edizioni note dello stesso titolo

9780691199665: A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability

Edizione in evidenza

ISBN 10:  0691199663 ISBN 13:  9780691199665
Casa editrice: Princeton Univ Pr, 2020
Brossura