Descriptive complexity of computable sequences (Q5958281)
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 1715282
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Descriptive complexity of computable sequences |
scientific article; zbMATH DE number 1715282 |
Statements
Descriptive complexity of computable sequences (English)
0 references
3 March 2002
0 references
infinite binary recursive sequences
0 references
0.8258627653121948
0 references
0.8221672773361206
0 references
0.8179633617401123
0 references
0.7847201228141785
0 references
