On process complexity

DOI10.4086/CJTCS.2010.004MaRDI QIDQ5414578zbMATH OpenOpenAlexFDO

Authors Adam R. Day

Publication date 6 May 2014

Published in Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/cjtcs.2010.004

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Strict process machine complexity
• scientific article; zbMATH DE number 107774
• The Kolmogorov complexity of random reals
• Effective complexity of stationary process realizations
• Randomness for computable measures and initial segment complexity

Cited in

(5)

• Process and truth-table characterisations of randomness
• Effective complexity of stationary process realizations
• Strict process machine complexity
• On the computational power of random strings
• Complex Independent Process Analysis

This page was built for publication: On process complexity

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