Table of Contents
Generalized Kolmogorov Complexity Hierarchy and Nonenumerable Universal Measures Computable in the Limit (Algorithmic TOEs, quant-ph/0011122, 2000; IJFCS vol 13(4):587-612, 2002)
Turing Machines
Example: limits of virtual realities and programmable universes?
Enumerable Output Machines (EOMs)
Formal Describability
Kolmogorov Complexity
Our Generalized Kolmogorov Complexities
Our Super Omegas: Limit-computable, yet still more random than ?, the halting probability of a TM
Relation to conditional K
Probabilities
Interesting theorems
Consequences for Inductive Inference
Coding theorems: PE vs KE
Approximable Measure ? vs KmG
Coding theorems: Slightly tighter elegant bounds?
Summary
|
Author: J. Schmidhuber
Email: juergen@idsia.ch
Home Page: http://www.idsia.ch/~juergen
|