Solomonoff Induction with Reflective Oracles
cs.CC
Submitted: 2026-11-10
Updated: 2026-11-10
Terminology
Sources
- Reflective Oracles: A Foundation for Classical Game Theory
- Logical Induction
- Forecasting using incomplete models
- Universal Prediction of Selected Bits
- A Formal Solution to the Grain of Truth Problem
- Limit-Computable Grains of Truth for Arbitrary Computable Extensive-Form (Un)Known Games
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?