Pages that link to "Item:Q5674429"
From MaRDI portal
The following pages link to A formal theory of inductive inference. Part I (Q5674429):
Displaying 50 items.
- Information theory: A multifaceted model of information (Q1407263) (← links)
- Applying MDL to learn best model granularity (Q1583224) (← links)
- A comparison of two approaches to pseudorandomness (Q1605323) (← links)
- Prediction of infinite words with automata (Q1635815) (← links)
- On measuring the complexity of networks: Kolmogorov complexity versus entropy (Q1687410) (← links)
- On the computability of Solomonoff induction and AIXI (Q1704559) (← links)
- Analogical proportions: from equality to inequality (Q1726246) (← links)
- Compressibility, laws of nature, initial conditions and complexity (Q1748033) (← links)
- Complexity analysis to explore the structure of ancient stromatolites (Q1878012) (← links)
- Randomness and reducibility (Q1878680) (← links)
- Generation of symmetric exponential sums (Q1881324) (← links)
- The dimensions of individual strings and sequences (Q1887139) (← links)
- One-way functions using algorithmic and classical information theories (Q1946513) (← links)
- Simplicity and likelihood: an axiomatic approach (Q1958953) (← links)
- Model selection based on minimum description length (Q1977908) (← links)
- \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration (Q1978498) (← links)
- A theory of incremental compression (Q2056272) (← links)
- Algorithmic information dynamics of cellular automata (Q2086706) (← links)
- Thinking with notations: epistemic actions and epistemic activities in mathematical practice (Q2101897) (← links)
- PAC-learning gains of Turing machines over circuits and neural networks (Q2111729) (← links)
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) (Q2120065) (← links)
- Streaming generalized cross entropy (Q2156541) (← links)
- Absolutely no free lunches! (Q2207503) (← links)
- An extended coding theorem with application to quantum complexities (Q2216136) (← links)
- Infotropism as the underlying principle of perceptual organization (Q2263970) (← links)
- Process complexity and effective random tests (Q2264549) (← links)
- Does the polynomial hierarchy collapse if onto functions are invertible? (Q2268347) (← links)
- On the computational power of random strings (Q2271990) (← links)
- Microscopic reversibility and macroscopic irreversibility: from the viewpoint of algorithmic randomness (Q2283143) (← links)
- The teaching size: computable teachers and learners for universal languages (Q2320594) (← links)
- On Martin-Löf (non-)convergence of Solomonoff's universal mixture (Q2348255) (← links)
- Cryptography and algorithmic randomness (Q2354584) (← links)
- On semimeasures predicting Martin-Löf random sequences (Q2381581) (← links)
- The Kolmogorov complexity of infinite words (Q2383593) (← links)
- Predicting non-stationary processes (Q2425399) (← links)
- Dynamics of inductive inference in a unified framework (Q2447262) (← links)
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem (Q2458453) (← links)
- Some non-conventional ideas about algorithmic complexity (Q2483647) (← links)
- Evolutionary induction of stochastic context free grammars (Q2485080) (← links)
- Certain aspects of graphic regularity (Q2557676) (← links)
- On the application of algorithmic information theory to decision problems (Q2559329) (← links)
- Uniform test of algorithmic randomness over a general space (Q2566004) (← links)
- Sequential predictions based on algorithmic complexity (Q2581758) (← links)
- Occam bound on lowest complexity of elements (Q2630827) (← links)
- An almost machine-independent theory of program-length complexity, sophistication, and induction (Q2638781) (← links)
- Real patterns and indispensability (Q2695015) (← links)
- Predictability, Complexity, and Learning (Q2784814) (← links)
- Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence. By D.L. Dowe, Berlin: Springer. 2013. 445 pp. £62.00 (softcover). ISBN 978-3-642-44957-4 (Q2804172) (← links)
- Solomonoff Induction Violates Nicod’s Criterion (Q2835642) (← links)
- On the Computability of Solomonoff Induction and Knowledge-Seeking (Q2835643) (← links)
