Turing degrees and randomness for continuous measures (Q6178468)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7790930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Turing degrees and randomness for continuous measures |
scientific article; zbMATH DE number 7790930 |
Statements
Turing degrees and randomness for continuous measures (English)
0 references
18 January 2024
0 references
A real is never continuous random (NCR for short) if it is not random with respect to any continuous measure. This notion has been studied by a number of people. But it is still unknown which Turing degree can contain such reals. In the paper under review, the authors prove some nice results to make some contributions to the topic. The major results are that any \(n\)-REA Turing degree contains an NCR real; and any selfmodule Turing degree contains an NCR real.
0 references
algorithmic randomness
0 references
continuous measures
0 references
Turing degrees
0 references
recursively enumerable and above
0 references
moduli of computation
0 references
0.8574371933937073
0 references
0.8154379725456238
0 references
0.7980342507362366
0 references
0.7934126257896423
0 references
0.7882254123687744
0 references
