Strict process machine complexity
From MaRDI portal
Publication:403400
DOI10.1007/S00153-014-0378-7zbMATH Open1304.68087OpenAlexW2072412515MaRDI QIDQ403400FDOQ403400
Authors: Ferit Toska 
Publication date: 29 August 2014
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-014-0378-7
Recommendations
Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cites Work
- Title not available (Why is that?)
- The dimensions of individual strings and sequences
- Process complexity and effective random tests
- Computability and randomness
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The definition of random sequences
- A formal theory of inductive inference. Part II
- A unified approach to the definition of random sequences
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dimension in Complexity Classes
- On process complexity
- Title not available (Why is that?)
- Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)
Cited In (3)
This page was built for publication: Strict process machine complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403400)
