Our Generalized Kolmogorov Complexities
TM U: K(x)=min {l(p): U(p)=x, p halts}
U(p)? x: program p converges to x
MTM U: KM(x)=min {l(p): U(p) ? x}
EOM U: KE(x)=min {l(p): U(p) ? x}
GTM U: KG(x)=min {l(p): U(p) ? x}
GTM U: KmG(x)=min {l(p): U(p) ? xz}
K and KE describable, KG not (Theorem 3.1)
Back to J. Schmidhuber's Kolmogorov page