On the public citation graph
Is There an Elegant Universal Theory of Prediction?
0 signed · 43 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.1007/11750321_39openalex-snapshot
On the Foundations of Universal Sequence Prediction
inferredcites →https://doi.org/10.1007/978-1-4757-2606-0openalex-snapshot
An Introduction to Kolmogorov Complexity and Its 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-3-540-27819-1_21openalex-snapshot
Convergence of Discrete MDL for Sequential Prediction
inferredcites →https://doi.org/10.1007/bf01700692openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1007/s00605-006-0423-7openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1016/s0019-9958(64)90131-7openalex-snapshot
A formal theory of inductive inference. Part II
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1016/s0304-3975(98)00073-5openalex-snapshot
Non-stochastic infinite and finite sequences
inferredcites →https://doi.org/10.1093/comjnl/11.2.185openalex-snapshot
An Information Measure for Classification
inferredcites →https://doi.org/10.1109/18.144706openalex-snapshot
Universal prediction of individual sequences
inferredcites →https://doi.org/10.1109/18.382012openalex-snapshot
The context-tree weighting method: basic properties
inferredcites →https://doi.org/10.1109/18.481776openalex-snapshot
Fisher information and stochastic complexity
inferredcites →https://doi.org/10.1109/tit.1978.1055913openalex-snapshot
Complexity-based induction systems: Comparisons and convergence theorems
inferredcites →https://doi.org/10.1109/tnn.1998.712192openalex-snapshot
Reinforcement Learning: An Introduction
inferredcites →https://doi.org/10.1109/tnn.2004.842673openalex-snapshot
Reinforcement Learning: An Introduction
inferredcites →https://doi.org/10.1145/262301.1040343openalex-snapshot
Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series))
inferredcites →https://doi.org/10.2307/2287892openalex-snapshot
Self-Calibrating Priors Do Not Exist: Comment
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-21365-1_23openalex-snapshot
The Space of Possible Mind Designs
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_28openalex-snapshot
Prediction of Infinite Words with Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-41649-6_24openalex-snapshot
A Few Notes on Multiple Theories and Conceptual Jump Size
inferred← citeshttps://doi.org/10.1007/978-3-642-24412-4_29openalex-snapshot
Asymptotically Optimal Agents
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_75openalex-snapshot
Making Solomonoff Induction Effective
inferred← citeshttps://doi.org/10.1007/978-3-642-32560-1_7openalex-snapshot
Artificial General Intelligence and the Human Mental Model
inferred← citeshttps://doi.org/10.1007/978-3-642-35506-6_7openalex-snapshot
A Representation Theorem for Decisions about Causal Models
inferred← citeshttps://doi.org/10.1007/s00224-016-9739-4openalex-snapshot
Prediction of Infinite Words with Automata
inferred← citeshttps://doi.org/10.1016/b978-0-444-52936-7.50018-5openalex-snapshot
Mechanizing Induction
inferred← citeshttps://doi.org/10.1287/lytx.2020.02.09openalex-snapshot
Ethical Artificial Intelligence
inferred← citeshttps://doi.org/10.15448/1984-6746.2020.2.37439openalex-snapshot
Modelos Dinâmicos Aplicados à Aprendizagem de Valores em Inteligência Artificial
inferred← citeshttps://doi.org/10.17760/d20194208openalex-snapshot
Infinite words as determined by languages of their prefixes
inferred← citeshttps://doi.org/10.2478/jagi-2021-0001openalex-snapshot
Measuring Intelligence and Growth Rate: Variations on Hibbard’s Intelligence Measure
inferred← citeshttps://doi.org/10.2478/popets-2020-0015openalex-snapshot
Illuminating the Dark or how to recover what should not be seen in FE-based classifiers
inferred← citeshttps://doi.org/10.3390/biomimetics5020019openalex-snapshot
Tutorial Review of Bio-Inspired Approaches to Robotic Manipulation for Space Debris Salvage
inferred← citeshttps://doi.org/10.36592/978-65-81110-12-3-02openalex-snapshot
Modelos Dinâmicos Aplicados a Aprendizagem de Valores em Inteligência Artificial
inferred← citeshttps://doi.org/10.36592/9786554600453-42openalex-snapshot
MODELOS DINÂMICOS APLICADOS À APRENDIZAGEM DE VALORES EM INTELIGÊNCIA ARTIFICIAL
inferred← citeshttps://doi.org/10.48550/arxiv.2008.02783openalex-snapshot
Modelos dinâmicos aplicados à aprendizagem de valores em inteligência artificial
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.