scientific article; zbMATH DE number 3805532
From MaRDI portal
Publication:4749828
zbMath0511.03016MaRDI QIDQ4749828
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsmeasurenatural numbersrecursive functionsT-optimalitygeneralized Kolmogorov complexitytheory of computable functions
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Abstract and axiomatic computability and recursion theory (03D75)
Related Items
Generalized kolmogorov complexity and other dual complexity measures ⋮ Algorithmic complexity of recursive and inductive algorithms