A complete theory of everything (will be subjective)

DOI10.3390/a3040329zbMath1465.00011arXiv0912.5434OpenAlexW2146387620WikidataQ58012300 ScholiaQ58012300MaRDI QIDQ1662561

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

zbMATH Keywords

computabilityuniversal theoriesOckham's razorpredictive powerno-free-lunchinductive reasoningworld modelsobserver localizationsimplicity and complexityuniversal self-sampling

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations, quantum information and its processing, quantum axioms, and philosophy (81P99) Foundational topics in statistics (62A99)

Related Items (1)

A philosophical treatise of universal induction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Foundations of computer science. Potential, theory, cognition
• Universal artificial intelligence. Sequential decisions based on algorithmic probability.
• On universal prediction and Bayesian confirmation
• The mathematical universe
• Sequential predictions based on algorithmic complexity
• HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
• Cosmology
• Science and Ultimate Reality
• A formal theory of inductive inference. Part II
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: A complete theory of everything (will be subjective)