DESCRIPTIONAL COMPLEXITY IN ENCODED BLUM STATIC COMPLEXITY SPACES
From MaRDI portal
Publication:5173293
DOI10.1142/S0129054114400152zbMath1320.68103OpenAlexW2011276709MaRDI QIDQ5173293
Publication date: 9 February 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054114400152
state complexityBlum static complexity spaceChaitin-Kolmogorov complexitydual complexity measureencoded function space
Formal languages and automata (68Q45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cites Work