Counting the changes of random Δ02 sets
Consider a Martin-Löf random Δ02 set Z. We give lower bounds for the number of changes of Zs|n for computable approximations of Z. We show that each nonempty Π0 1 class has a low member Z with a computable approximation that changes only o(2n ) times. We prove that each superlow ML-random set alread...
Guardado en:
| Autor principal: | Figueira, Santiago Daniel |
|---|---|
| Publicado: |
2010
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v6158LNCS_n_p162_Figueira http://hdl.handle.net/20.500.12110/paper_03029743_v6158LNCS_n_p162_Figueira |
| Aporte de: |
Ejemplares similares
-
Counting the changes of random Δ02 sets
por: Figueira, S., et al. -
Counting the changes of random Δ<inf>2</inf>0 sets
por: Figueira, Santiago Daniel
Publicado: (2011) -
Counting the changes of random Δ<inf>2</inf>0 sets
por: Figueira, S., et al. -
Level sets and extrema of random processes and fields /
por: Azaïs, Jean-Marc, 1957-
Publicado: (2009) -
Level sets and extrema of random processes and fields
por: Aza�is, Jean-Marc, 1957-
Publicado: (2009)