On the Kolmogorov Complexity of Continuous Real Functions
DOI10.1007/978-3-642-21875-0_9zbMath1259.03056OpenAlexW4230151589MaRDI QIDQ3091443
Publication date: 9 September 2011
Published in: Models of Computation in Context (Search for Journal in Brave)
Full work available at URL: http://eprints.nottingham.ac.uk/56380/1/2013-Farjudian-On_the_Kolmogorov_complexity_of_continuous_real_functions-APAL_Journal.pdf
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Set functions and measures and integrals in infinite-dimensional spaces (Wiener measure, Gaussian measure, etc.) (28C20) Continuous lattices and posets, applications (06B35) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)
Related Items (1)
Uses Software
Cites Work
- On Kolmogorov complexity in the real Turing machine setting
- A domain-theoretic approach to computability on the real line
- On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
- The Kolmogorov complexity of real numbers.
- Taylor forms -- use and limits.
- On the Kolmogorov complexity of continuous real functions
- RealLib: An efficient implementation of exact real arithmetic
- Prevalence: a translation-invariant “almost every” on infinite-dimensional spaces
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Continuous Lattices and Domains
- Kolmogorov Complexity Theory over the Reals
- A formal theory of inductive inference. Part I
- A formal theory of inductive inference. Part II
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the Kolmogorov Complexity of Continuous Real Functions
