Ordinal recursive complexity of unordered data nets (Q529043)
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: Ordinal recursive complexity of unordered data nets |
scientific article; zbMATH DE number 6720009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ordinal recursive complexity of unordered data nets |
scientific article; zbMATH DE number 6720009 |
Statements
Ordinal recursive complexity of unordered data nets (English)
0 references
18 May 2017
0 references
data nets
0 references
ordinal recursive complexity
0 references
hyper-Ackermannian problems
0 references
fast-growing complexity hierarchy
0 references
multisets over \(\mathbb{N}^k\)
0 references
0 references
0.790134847164154
0 references
0.7899017333984375
0 references
0.7821788191795349
0 references
0.7778239846229553
0 references
0.775486171245575
0 references
