Books > Computing & IT > General theory of computing
|
Buy Now
A Hierarchy of Turing Degrees - A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) (Hardcover)
Loot Price: R3,731
Discovery Miles 37 310
|
|
A Hierarchy of Turing Degrees - A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) (Hardcover)
Series: Annals of Mathematics Studies
Expected to ship within 12 - 17 working days
|
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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|