On the Kolmogorov complexity of continuous real functions

DOI10.1016/J.APAL.2012.11.003MaRDI QIDQ1944334zbMATH OpenOpenAlexFDO

Authors Amin Farjudian

Publication date 5 April 2013

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apal.2012.11.003

zbMATH Keywords

algorithmic randomnesscomputable analysisdomain theoryKolmogorov complexitymeasure theoryprevalence

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78) Continuous lattices and posets, applications (06B35) Set functions and measures and integrals in infinite-dimensional spaces (Wiener measure, Gaussian measure, etc.) (28C20) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• On the Kolmogorov complexity of continuous real functions
• On Kolmogorov complexity in the real Turing machine setting
• Kolmogorov Complexity Theory over the Reals
• On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
• The Kolmogorov complexity of random reals

Cited in

(9)

• On the Kolmogorov complexity of functions of finite smoothness
• On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
• The Kolmogorov complexity of random reals
• Analytical properties of resource-bounded real functionals
• On Kolmogorov complexity in the real Turing machine setting
• On the Kolmogorov complexity of continuous real functions
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• Kolmogorov Complexity Theory over the Reals
• New Computational Paradigms

This page was built for publication: On the Kolmogorov complexity of continuous real functions

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