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 - Brossura
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 40,80
EUR 3,88 per la spedizione in U.S.A.
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, 385)
Da: Labyrinth Books, Princeton, NJ, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. Codice articolo 244326
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
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo WP-9780691199665
Quantità: 1 disponibili
Immagini fornite dal venditore
A hierarchy of Turing degrees. Annals of mathematics studies.
Editore:
Princeton and Oxford, Princeton University Press, 2020
ISBN 10: 0691199663
ISBN 13: 9780691199665
Antico o usato
Softcover
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
Softcover. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. X-10471 9780691199665 Sprache: Deutsch Gewicht in Gramm: 350. Codice articolo 2390441
Quantità: 1 disponibili
Foto dell'editore
A Hierarchy of Turing Degrees
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo WP-9780691199665
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. Paperback. . . . . . Codice articolo V9780691199665
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 (Annals of Mathematics Studies, 206)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2416190103972
Quantità: Più di 20 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 38642570-n
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)
Editore:
Princeton University Press, 2020
ISBN 10: 0691199663
ISBN 13: 9780691199665
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days. 185. Codice articolo B9780691199665
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 (Annals of Mathematics Studies, 206)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780691199665_new
Quantità: 1 disponibili
Immagini fornite dal venditore
A Hierarchy of Turing Degrees
Editore:
Princeton University Press, US, 2020
ISBN 10: 0691199663
ISBN 13: 9780691199665
Nuovo
Paperback
Da: Rarewaves USA, OSWEGO, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. 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-9780691199665
Quantità: Più di 20 disponibili