Registro completo de metadatos
Campo DC Valor Lengua/Idioma
dc.creatorFigueira, Santiago-
dc.creatorHirschfeldt, Denis R.-
dc.creatorMiller, Joseph S.-
dc.creatorNg, Keng Meng-
dc.creatorNies, André-
dc.date2017-12-04T18:40:28Z-
dc.date2017-12-04T18:40:28Z-
dc.date2013-01-
dc.date2017-05-15T21:08:02Z-
dc.date.accessioned2019-04-29T15:45:38Z-
dc.date.available2019-04-29T15:45:38Z-
dc.date.issued2013-01-
dc.identifierFigueira, Santiago; Hirschfeldt, Denis R.; Miller, Joseph S.; Ng, Keng Meng; Nies, André; Counting the changes of random Δ20 sets; Oxford University Press; Journal Of Logic And Computation; 25; 4; 1-2013; 1073-1089-
dc.identifier0955-792X-
dc.identifierhttp://hdl.handle.net/11336/29585-
dc.identifier1465-363X-
dc.identifier.urihttp://rodna.bn.gov.ar:8080/jspui/handle/bnmm/301340-
dc.descriptionWe study the number of changes of the initial segment Zs ↾n for computable approximations of a Martin-Löf random Δ02Δ20 set Z. We establish connections between this number of changes and various notions of computability theoretic lowness, as well as the fundamental thesis that, among random sets, randomness is antithetical to computational power. We introduce a new randomness notion, called balanced randomness, which implies that for each computable approximation and each constant c, there are infinitely many n such that Zs ↾n changes more than c2n times. We establish various connections with ω-c.e. tracing and omega;-c.e. jump domination, a new lowness property. We also examine some relationships to randomness theoretic notions of highness, and give applications to the study of (weak) Demuth cuppability.-
dc.descriptionFil: Figueira, Santiago. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina-
dc.descriptionFil: Hirschfeldt, Denis R.. University of Chicago; Estados Unidos-
dc.descriptionFil: Miller, Joseph S.. University of Wisconsin; Estados Unidos-
dc.descriptionFil: Ng, Keng Meng. Nanyang Technological University; Singapur-
dc.descriptionFil: Nies, André. The University Of Auckland; Nueva Zelanda-
dc.formatapplication/pdf-
dc.formatapplication/pdf-
dc.languageeng-
dc.publisherOxford University Press-
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1093/logcom/exs083-
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://academic.oup.com/logcom/article-abstract/25/4/1073/966067-
dc.rightsinfo:eu-repo/semantics/openAccess-
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/-
dc.sourcereponame:CONICET Digital (CONICET)-
dc.sourceinstname:Consejo Nacional de Investigaciones Científicas y Técnicas-
dc.sourceinstacron:CONICET-
dc.subjectMARTIN-LÖF RANDOMNESS-
dc.subjectDEMUTH RANDOMNESS-
dc.subjectCOMPUTABLE APPROXIMATION-
dc.subjectOMEGA-C.E.-
dc.subjectCiencias de la Computación-
dc.subjectCiencias de la Computación e Información-
dc.subjectCIENCIAS NATURALES Y EXACTAS-
dc.titleCounting the changes of random Δ20 sets-
dc.typeinfo:eu-repo/semantics/article-
dc.typeinfo:eu-repo/semantics/publishedVersion-
dc.typeinfo:ar-repo/semantics/articulo-
Aparece en las colecciones: CONICET

Ficheros en este ítem:
No hay ficheros asociados a este ítem.