Lowness properties and approximations of the jump
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...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Artículo publishedVersion |
| Lenguaje: | Inglés |
| Publicado: |
2008
|
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_01680072_v152_n1-3_p51_Figueira |
| Aporte de: |
| id |
paperaa:paper_01680072_v152_n1-3_p51_Figueira |
|---|---|
| record_format |
dspace |
| spelling |
paperaa:paper_01680072_v152_n1-3_p51_Figueira2023-06-12T16:47:00Z Lowness properties and approximations of the jump Ann. Pure Appl. Logic 2008;152(1-3):51-66 Figueira, S. Nies, A. Stephan, F. ω-r.e. K-triviality Kolmogorov complexity Lowness Traceability 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. Informally, a set A is strongly jump-traceable if for each order function h, for each input e one may effectively enumerate a set Te of possible values for the jump JA (e), and the number of values enumerated is at most h (e). A′ is well-approximable if can be effectively approximated with less than h (x) changes at input x, for each order function h. We prove that there is a strongly jump-traceable set which is not computable, and that if A′ is well-approximable then A is strongly jump-traceable. For r.e. sets, the converse holds as well. We characterize jump-traceability and strong jump-traceability in terms of Kolmogorov complexity. We also investigate other properties of these lowness properties. © 2007 Elsevier B.V. All rights reserved. Fil:Figueira, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2008 info:eu-repo/semantics/article info:ar-repo/semantics/artículo info:eu-repo/semantics/publishedVersion application/pdf eng info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_01680072_v152_n1-3_p51_Figueira |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| language |
Inglés |
| orig_language_str_mv |
eng |
| topic |
ω-r.e. K-triviality Kolmogorov complexity Lowness Traceability |
| spellingShingle |
ω-r.e. K-triviality Kolmogorov complexity Lowness Traceability Figueira, S. Nies, A. Stephan, F. Lowness properties and approximations of the jump |
| topic_facet |
ω-r.e. K-triviality Kolmogorov complexity Lowness Traceability |
| description |
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. Informally, a set A is strongly jump-traceable if for each order function h, for each input e one may effectively enumerate a set Te of possible values for the jump JA (e), and the number of values enumerated is at most h (e). A′ is well-approximable if can be effectively approximated with less than h (x) changes at input x, for each order function h. We prove that there is a strongly jump-traceable set which is not computable, and that if A′ is well-approximable then A is strongly jump-traceable. For r.e. sets, the converse holds as well. We characterize jump-traceability and strong jump-traceability in terms of Kolmogorov complexity. We also investigate other properties of these lowness properties. © 2007 Elsevier B.V. All rights reserved. |
| format |
Artículo Artículo publishedVersion |
| author |
Figueira, S. Nies, A. Stephan, F. |
| author_facet |
Figueira, S. Nies, A. Stephan, F. |
| author_sort |
Figueira, S. |
| title |
Lowness properties and approximations of the jump |
| title_short |
Lowness properties and approximations of the jump |
| title_full |
Lowness properties and approximations of the jump |
| title_fullStr |
Lowness properties and approximations of the jump |
| title_full_unstemmed |
Lowness properties and approximations of the jump |
| title_sort |
lowness properties and approximations of the jump |
| publishDate |
2008 |
| url |
http://hdl.handle.net/20.500.12110/paper_01680072_v152_n1-3_p51_Figueira |
| work_keys_str_mv |
AT figueiras lownesspropertiesandapproximationsofthejump AT niesa lownesspropertiesandapproximationsofthejump AT stephanf lownesspropertiesandapproximationsofthejump |
| _version_ |
1769810285681442816 |