2015/01/03 by Eray Özkural, Özkural, Eray
Computer Science · Physics and Astronomy · #Artificial Intelligence (cs.AI) #Computability, Logic, AI Algorithms #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #Quantum Computing Algorithms and Architecture #Quantum Mechanics and Applications
paper · pdf · doi:10.48550/arxiv.1501.00601
openalex publication_date 2015/01/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose that Solomonoff induction is complete in the physical sense via\nseveral strong physical arguments. We also argue that Solomonoff induction is\nfully applicable to quantum mechanics. We show how to choose an objective\nreference machine for universal induction by defining a physical message\ncomplexity and physical message probability, and argue that this choice\ndissolves some well-known objections to universal induction. We also introduce\nmany more variants of physical message complexity based on energy and action,\nand discuss the ramifications of our proposals.\n