Noncomplex sequences: characterizations and examples
From MaRDI portal
Publication:4140388
DOI10.2307/2272040zbMath0365.68054OpenAlexW4237174060MaRDI QIDQ4140388
Publication date: 1976
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2272040
Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99)
Related Items
On the notion of infinite pseudorandom sequences, Several results in program size complexity, On the inference of optimal descriptions, Toward an abstract theory of data compression
