Compartir
Downey, r: Hierarchy of Turing Degrees (Annals of Mathematics Studies) (en Inglés)
Rod Downey; Noam Greenberg (Autor)
·
Princeton University Press
· Tapa Blanda
Downey, r: Hierarchy of Turing Degrees (Annals of Mathematics Studies) (en Inglés) - Rod Downey; Noam Greenberg
105,17 €
110,70 €
Ahorras: 5,54 €
Elige la lista en la que quieres agregar tu producto o crea una nueva lista
✓ Producto agregado correctamente a la lista de deseos.
Ir a Mis ListasSe enviará desde nuestra bodega entre el
Jueves 11 de Julio y el
Lunes 15 de Julio.
Lo recibirás en cualquier lugar de España entre 1 y 5 días hábiles luego del envío.
Reseña del libro "Downey, r: Hierarchy of Turing Degrees (Annals of Mathematics Studies) (en Inglés)"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
Todos los libros de nuestro catálogo son Originales.
El libro está escrito en Inglés.
La encuadernación de esta edición es Tapa Blanda.
✓ Producto agregado correctamente al carro, Ir a Pagar.