Pages that link to "Item:Q5626617"
From MaRDI portal
The following pages link to THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS (Q5626617):
Displayed 50 items.
- Complexity measures of words based on string matching and edit distance (Q1838299) (← links)
- Recursive computational depth. (Q1854307) (← links)
- Most sequences are stochastic (Q1854454) (← links)
- Suboptimal measures of predictive complexity for absolute loss function (Q1854535) (← links)
- On complexity of easy predictable sequences (Q1854565) (← links)
- Algorithmic analysis of irrational rotations in a single neuron model (Q1869962) (← links)
- Randomness and reducibility (Q1878680) (← links)
- The dimensions of individual strings and sequences (Q1887139) (← links)
- The Kolmogorov complexity of random reals (Q1887661) (← links)
- Universal computation and physical dynamics (Q1896542) (← links)
- Geometry of the space of triangulations of a compact manifold (Q1925001) (← links)
- Using ideas of Kolmogorov complexity for studying biological texts (Q1946512) (← links)
- One-way functions using algorithmic and classical information theories (Q1946513) (← links)
- On an algorithm to generate weakly correlated random numbers (Q1947754) (← links)
- Limit complexities revisited (Q1959396) (← links)
- A cell dynamical system model of chemical turbulence. (Q1963599) (← links)
- Physical complexity of symbolic sequences (Q1969877) (← links)
- Putnam's diagonal argument and the impossibility of a universal learning machine (Q2051127) (← links)
- Thinking with notations: epistemic actions and epistemic activities in mathematical practice (Q2101897) (← links)
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) (Q2120065) (← links)
- Clustering with respect to the information distance (Q2166746) (← links)
- Gacs-Kucera theorem (Q2166747) (← links)
- Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy (Q2177476) (← links)
- Things that can be made into themselves (Q2252527) (← links)
- Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive'' derandomization (Q2254499) (← links)
- Zipf's law and L. Levin probability distributions (Q2258210) (← links)
- On the computational power of random strings (Q2271990) (← links)
- On Martin-Löf (non-)convergence of Solomonoff's universal mixture (Q2348255) (← links)
- Trivial measures are not so trivial (Q2354580) (← links)
- On semimeasures predicting Martin-Löf random sequences (Q2381581) (← links)
- On universal prediction and Bayesian confirmation (Q2382281) (← links)
- `Ideal learning' of natural language: positive results about learning from positive evidence (Q2382634) (← links)
- The Kolmogorov complexity of infinite words (Q2383593) (← links)
- Computability of probability measures and Martin-Löf randomness over metric spaces (Q2389335) (← links)
- A coding theorem for enumerable output machines (Q2390302) (← links)
- Predicting non-stationary processes (Q2425399) (← links)
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem (Q2458453) (← links)
- Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets (Q2500468) (← links)
- Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series (Q2503313) (← links)
- Algorithmic tests and randomness with respect to a class of measures (Q2510759) (← links)
- On joint conditional complexity (entropy) (Q2510760) (← links)
- Uniform test of algorithmic randomness over a general space (Q2566004) (← links)
- How many strings are easy to predict? (Q2566221) (← links)
- Resource bounded symmetry of information revisited (Q2575757) (← links)
- Kolmogorov-Loveland randomness and stochasticity (Q2576945) (← links)
- Experimental investigation of forecasting methods based on data compression algorithms (Q2577286) (← links)
- Sequential predictions based on algorithmic complexity (Q2581758) (← links)
- An almost machine-independent theory of program-length complexity, sophistication, and induction (Q2638781) (← links)
- The Kučera-Gács theorem revisited by Levin (Q2682931) (← links)
- Predictive Complexity for Games with Finite Outcome Spaces (Q2805719) (← links)