Lowness properties and approximations of the jump

Mostrar todas las versiones(6)

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

Guardado en:
Detalles Bibliográficos
Autores principales: Figueira, S., Nies, A., Stephan, F.
Formato: Artículo publishedVersion
Publicado: 2008
Materias:
ω-r.e.
K-triviality
Kolmogorov complexity
Lowness
Traceability
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_01680072_v152_n1-3_p51_Figueira
https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_01680072_v152_n1-3_p51_Figueira_oai
Aporte de:
Repositorio Digital de la Universidad de Buenos Aires (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares