Noncomplex sequences: characterizations and examples

DOI10.2307/2272040MaRDI QIDQ4140388zbMATH OpenOpenAlexFDO

Authors Robert P. Daley

Publication date 1976

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2272040

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99) Analysis of algorithms and problem complexity (68Q25)

Cited in

(4)

• 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

This page was built for publication: Noncomplex sequences: characterizations and examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140388)