On the public citation graph
Solomonoff Prediction and Occam’s Razor
0 signed · 59 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcss.1997.1500openalex-snapshot
The Discovery of Algorithmic Probability
inferredcites →https://doi.org/10.1007/0-387-27656-4openalex-snapshot
Statistical and Inductive Inference by Minimum Message Length
inferredcites →https://doi.org/10.1007/978-0-387-49820-1openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-0-387-68441-3openalex-snapshot
Algorithmic Randomness and Complexity
inferredcites →https://doi.org/10.1007/978-0-387-84816-7openalex-snapshot
Information Theory and Statistical Learning
inferredcites →https://doi.org/10.1007/978-0-387-84816-7_1openalex-snapshot
Algorithmic Probability: Theory and Applications
inferredcites →https://doi.org/10.1007/978-3-030-11298-1openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-94-010-3142-4_22openalex-snapshot
Unknown Probabilities, Bayesianism, and De Finetti’s Representation Theorem
inferredcites →https://doi.org/10.1016/b978-0-444-51726-5.50014-5openalex-snapshot
OCKHAM'S RAZOR, TRUTH, AND INFORMATION
inferredcites →https://doi.org/10.1016/b978-0-444-52936-7.50008-2openalex-snapshot
Carnap and the Logic of Inductive Inference
inferredcites →https://doi.org/10.1016/j.tcs.2007.05.016openalex-snapshot
On universal prediction and Bayesian confirmation
inferredcites →https://doi.org/10.1016/j.tcs.2009.09.017openalex-snapshot
Stationary algorithmic probability
inferredcites →https://doi.org/10.1016/s0019-9958(64)90223-2openalex-snapshot
A formal theory of inductive inference. Part I
inferredcites →https://doi.org/10.1016/s1874-5857(09)70548-5openalex-snapshot
Handbook of the History of Logic
inferredcites →https://doi.org/10.1017/cbo9780511546921openalex-snapshot
Prediction, Learning, and Games
inferredcites →https://doi.org/10.1023/b:synt.0000044993.82886.9eopenalex-snapshot
Hypotheses and Inductive Predictions
inferredcites →https://doi.org/10.1070/rm1970v025n06abeh001269openalex-snapshot
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
inferredcites →https://doi.org/10.1086/592550openalex-snapshot
The Meta-inductivist's Winning Strategy in the Prediction Game: A New Approach to Hume's Problem
inferredcites →https://doi.org/10.1093/0198250371.001.0001openalex-snapshot
Hume's problem: induction and the justification of belief
inferredcites →https://doi.org/10.1093/acprof:oso/9780199230761.001.0001openalex-snapshot
Computability and Randomness
inferredcites →https://doi.org/10.1093/bjps/axr016openalex-snapshot
The Physical Church–Turing Thesis: Modest or Bold?
inferredcites →https://doi.org/10.1093/oso/9780195091953.001.0001openalex-snapshot
The Logic of Reliable Inquiry
inferredcites →https://doi.org/10.1109/tit.1978.1055913openalex-snapshot
Complexity-based induction systems: Comparisons and convergence theorems
inferredcites →https://doi.org/10.1109/tit.2003.814488openalex-snapshot
Convergence and loss bounds for bayesian sequence prediction
inferredcites →https://doi.org/10.1109/tit.2005.856956openalex-snapshot
Asymptotics of Discrete MDL for Online Prediction
inferredcites →https://doi.org/10.1109/tsmc.1987.4309045openalex-snapshot
Uncertainty in Artificial Intelligence
inferredcites →https://doi.org/10.1112/blms/23.1.106openalex-snapshot
STOCHASTIC COMPLEXITY IN STATISTICAL INQUIRY
inferredcites →https://doi.org/10.1142/0822openalex-snapshot
Stochastic Complexity in Statistical Inquiry
inferredcites →https://doi.org/10.1145/321495.321506openalex-snapshot
On the Length of Programs for Computing Finite Binary Sequences
inferredcites →https://doi.org/10.1214/aoms/1177704456openalex-snapshot
Merging of Opinions with Increasing Information
inferredcites →https://doi.org/10.1214/aop/1176991251openalex-snapshot
Kolmogorov: Life and Creative Activities
inferredcites →https://doi.org/10.1515/9781400838684-014openalex-snapshot
The New Riddle of Induction
inferredcites →https://doi.org/10.2307/2273587openalex-snapshot
Probabilities over rich languages, testing and randomness
inferredcites →https://doi.org/10.7551/mitpress/1114.001.0001openalex-snapshot
Advances in Minimum Description Length
inferredcites →https://doi.org/10.7551/mitpress/1114.003.0009openalex-snapshot
Algorithmic Statistics and Kolmogorov's Structure Functions
inferredcites →https://doi.org/10.7551/mitpress/4643.001.0001openalex-snapshot
The Minimum Description Length Principle
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10670-018-9975-xopenalex-snapshot
Putnam’s Diagonal Argument and the Impossibility of a Universal Learning Machine
inferred← citeshttps://doi.org/10.1007/s10670-026-01069-0openalex-snapshot
Variance Normalization and Disagreement
inferred← citeshttps://doi.org/10.1007/s11023-024-09703-yopenalex-snapshot
Statistical Learning Theory and Occam’s Razor: The Core Argument
inferred← citeshttps://doi.org/10.1007/s11042-016-4222-4openalex-snapshot
Single slice based detection for Alzheimer’s disease via wavelet entropy and multilayer perceptron trained by biogeography-based optimization
inferred← citeshttps://doi.org/10.1007/s42113-024-00219-3openalex-snapshot
The Problem-Ladenness of Theory
inferred← citeshttps://doi.org/10.1017/9781009210171openalex-snapshot
Probability and Inductive Logic
inferred← citeshttps://doi.org/10.1017/psa.2022.72openalex-snapshot
A Dilemma for Solomonoff Prediction
inferred← citeshttps://doi.org/10.1086/709786openalex-snapshot
PAC Learning and Occam’s Razor: Probably Approximately Incorrect
inferred← citeshttps://doi.org/10.1098/rsfs.2016.0121openalex-snapshot
Is behavioural flexibility evidence of cognitive complexity? How evolution can inform comparative cognition
inferred← citeshttps://doi.org/10.3390/e28091005openalex-snapshot
Category-Native Solomonoff Approximation: From Algorithmic Geometry to Kernels, Operators, and Induction
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.