We propose that Solomonoff induction is complete in the physical sense via several strong physical arguments. We also argue that Solomonoff induction is fully applicable to quantum mechanics. We show how to choose an objective reference machine for universal induction by defining a physical message complexity and physical message probability, and argue that this choice dissolves some well-known objections to universal induction. We also introduce many more variants of physical message complexity based on energy and action, and discuss the ramifications of our proposals.
CITATION STYLE
Özkural, E. (2015). Ultimate intelligence part I: Physical completeness and objectivity of induction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9205, pp. 131–141). Springer Verlag. https://doi.org/10.1007/978-3-319-21365-1_14
Mendeley helps you to discover research relevant for your work.