Characterizing the strongly jump-traceable sets via randomness (Q456804)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterizing the strongly jump-traceable sets via randomness |
scientific article; zbMATH DE number 6094112
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing the strongly jump-traceable sets via randomness |
scientific article; zbMATH DE number 6094112 |
Statements
Characterizing the strongly jump-traceable sets via randomness (English)
0 references
16 October 2012
0 references
strongly jump-traceable sets
0 references
randomness
0 references
superlowness
0 references
0.9297027
0 references
0 references
0.88239986
0 references
0.88012856
0 references
0.87970436
0 references
0 references
0.8637606
0 references
0.8401374
0 references
0.8365834
0 references
0.8330318
0 references
Strong jump-traceability was introduced for some very technical reasons. Though the class was known to be a proper subset of \(K\)-trivial sets, it was not clear whether there is a connection between the class and randomness.NEWLINENEWLINEThe authors in the paper under review reveal a significant connection between these notions. They show that c.e. strongly jump-traceable sets are precisely those c.e. sets computable from every superlow random set. Moreover, they are also precisely those c.e. sets computable from every superhigh random set.
0 references
