Ordinal recursive complexity of Unordered Data Nets☆
Under an Elsevier user license
open archive
Keywords
Data nets
Ordinal recursive complexity
Hyper-Ackermannian problems
Fast-growing complexity hierarchy
Multisets over
Cited by (0)
- ☆
Author is partially supported by the Spanish projects TRACES TIN2015-67522-C3-3-R and N-Greens S2013/ICE-2731.
© 2017 Elsevier Inc.