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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 3,00 für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerEUR 14,57 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerAnbieter: Labyrinth Books, Princeton, NJ, USA
Zustand: New. Bestandsnummer des Verkäufers 244326
Anzahl: 5 verfügbar
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
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. Bestandsnummer des Verkäufers 2390441
Anzahl: 1 verfügbar
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers WP-9780691199665
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: 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. Bestandsnummer des Verkäufers 333725332
Anzahl: 1 verfügbar
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: New. 2020. Paperback. . . . . . Bestandsnummer des Verkäufers V9780691199665
Anzahl: 1 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: New. Bestandsnummer des Verkäufers 38642570-n
Anzahl: 1 verfügbar
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
Paperback / softback. Zustand: New. New copy - Usually dispatched within 4 working days. 185. Bestandsnummer des Verkäufers B9780691199665
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Neuware - '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'. Bestandsnummer des Verkäufers 9780691199665
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Bestandsnummer des Verkäufers ria9780691199665_new
Anzahl: 1 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 38642570
Anzahl: 1 verfügbar