Articoli correlati a A Hierarchy of Turing Degrees: A Transfinite Hierarchy...
A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability - Rilegato
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.
Compra nuovo
Visualizza questo articolo
EUR 72,90
EUR 22,18 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costi
Risultati della ricerca per A Hierarchy of Turing Degrees: A Transfinite Hierarchy...
Foto dell'editore
A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural . (Annals of Mathematics Studies, 382)
Da: Labyrinth Books, Princeton, NJ, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 244188
Quantità: 5 disponibili
Foto dell'editore
A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (Annals of Mathematics Studies)
Editore:
Princeton University Press, 2020
ISBN 10: 0691199655
ISBN 13: 9780691199658
Antico o usato
Rilegato
Da: Books From California, Simi Valley, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
hardcover. Condizione: Acceptable. Damage on front cover. Codice articolo mon0003654549
Quantità: 1 disponibili
Foto dell'editore
A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206)
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
Condizione: New. 2020. Hardcover. . . . . . Codice articolo V9780691199658
Quantità: 15 disponibili
Foto dell'editore
A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206)
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. 2020. Hardcover. . . . . . Books ship from the US and Ireland. Codice articolo V9780691199658
Quantità: 15 disponibili
Immagini fornite dal venditore
Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 38642569-n
Quantità: 1 disponibili
Immagini fornite dal venditore
Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 38642569-n
Quantità: 1 disponibili
Immagini fornite dal venditore
Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability
Editore:
Princeton University Press, 2020
ISBN 10: 0691199655
ISBN 13: 9780691199658
Antico o usato
Rilegato
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 38642569
Quantità: 1 disponibili
Immagini fornite dal venditore
A Hierarchy of Turing Degrees
Editore:
Princeton University Press, US, 2020
ISBN 10: 0691199655
ISBN 13: 9780691199658
Nuovo
Rilegato
Da: Rarewaves USA, OSWEGO, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: New. 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. Codice articolo LU-9780691199658
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
A Hierarchy of Turing Degrees
Editore:
Princeton University Press, US, 2020
ISBN 10: 0691199655
ISBN 13: 9780691199658
Nuovo
Rilegato
Da: Rarewaves USA United, OSWEGO, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: New. 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. Codice articolo LU-9780691199658
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definab
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Über den AutorRod 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 Co. Codice articolo 333725331
Quantità: Più di 20 disponibili