Hierarchy of Turing Degrees
A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability
839 kr
Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.
Fler format och utgåvor
Beskrivning
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.
Produktinformation
Utforska kategorier
Mer om författaren
Recensioner i media
Hoppa över listan
Mer från samma författare
Del 42
PROCEEDINGS OF THE 12TH ASIAN LOGIC CONFERENCE
Downey Rod, Rod Downey, Jörg Brendle, Robert Goldblatt, Byunghan Kim
Inbunden, 2013
1 848 kr
MATHEMATICAL LOGIC, COMPUTABILITY, COMPLEXITY, AND RANDOMNESS - PROCEEDINGS OF THE 16TH ASIAN LOGIC CONFERENCE AND 14TH INTERNATIONAL CONFERENCE ON COMPUTABILITY, COMPLEXITY, AND RANDOMNESS
Brendle Joerg, Joerg Brendle, Rod Downey, Sergey S Goncharov, Manat Mustafa, Guohua Wu, Yue Yang
Inbunden, 2025
1 379 kr
Hoppa över listan
Mer från samma serie
Entire Holomorphic Mappings in One and Several Complex Variables
Phillip A. Griffiths
Häftad, 1976
678 kr
Commensurabilities among Lattices in PU (1,n)
Pierre R. Deligne, George Daniel Mostow
Häftad, 1993
941 kr
Hoppa över listan
Du kanske också är intresserad av
- 10% rabatt på allt
Del 42
ASPECTS OF COMPUTATION AND AUTOMATA THEORY WITH APPLICATIONS
Greenberg Noam, Noam Greenberg, Sanjay Jain, Keng Meng Ng, Sven Schewe, Frank Stephan, Guohua Wu, Yue Yang
Inbunden, 2023
2 173 kr
Computability and Complexity
Frances Rosamond, Alexander Melnikov, Bakhadyr Khoussainov, Noam Greenberg, Michael Fellows, Adam Day
E-bok
2016710 kr
Algebraic Curves and Riemann Surfaces for Undergraduates : The Theory of the Donut
Anil Nerode, Noam Greenberg
646 kr
Algebraic Curves and Riemann Surfaces for Undergraduates
Anil Nerode, Noam Greenberg
Häftad, 2023
665 kr
Del 41
Effective Mathematics of the Uncountable
Noam Greenberg, Denis Hirschfeldt, Joel David Hamkins, Russell Miller
Inbunden, 2013
1 944 kr