Arithmetic complexity via effective names for random sequences (Q2946673)
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: Arithmetic complexity via effective names for random sequences |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Arithmetic complexity via effective names for random sequences |
scientific article |
Statements
Arithmetic complexity via effective names for random sequences (English)
0 references
17 September 2015
0 references
Schnorr randomness
0 references
arithmetical hierarchy
0 references
computable randomness
0 references
0.8244483470916748
0 references
0.788260817527771
0 references
0.7879924178123474
0 references
0.7807796597480774
0 references
0.7797817587852478
0 references
