A complete theory of everything (will be subjective)
DOI10.3390/A3040329zbMATH Open1465.00011arXiv0912.5434OpenAlexW2146387620WikidataQ58012300 ScholiaQ58012300MaRDI QIDQ1662561FDOQ1662561
Authors: Marcus Hutter
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.5434
Recommendations
computabilitypredictive powerno-free-lunchOckham's razoruniversal theoriesinductive reasoningworld modelsobserver localizationsimplicity and complexityuniversal self-sampling
Foundational topics in statistics (62A99) Foundations, quantum information and its processing, quantum axioms, and philosophy (81P99) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Philosophy of mathematics (00A30)
Cites Work
- A formal theory of inductive inference. Part II
- Title not available (Why is that?)
- An introduction to Kolmogorov complexity and its applications
- The mathematical universe
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
- On universal prediction and Bayesian confirmation
- Title not available (Why is that?)
- Sequential predictions based on algorithmic complexity
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
- Science and Ultimate Reality
- Cosmology
- Foundations of computer science. Potential, theory, cognition
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: A complete theory of everything (will be subjective)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662561)