Lowness properties and approximations of the jump

Mostrar todas las versiones(2)

We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-lowness for sets of natural numbers. A computable non-decreasing unbounded function h is called an order function. Informa...

Descripción completa

Detalles Bibliográficos
Autor principal: Figueira, Santiago Daniel
Publicado: 2008
Materias:
ω-r.e.
K-triviality
Kolmogorov complexity
Lowness
Traceability
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01680072_v152_n1-3_p51_Figueira
http://hdl.handle.net/20.500.12110/paper_01680072_v152_n1-3_p51_Figueira
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares