Prefix-like Complexities of Finite and Infinite Sequences on Generalized Turing Machines.

Chernov, Alexey and Schmidhuber, Juergen (2005) Prefix-like Complexities of Finite and Infinite Sequences on Generalized Turing Machines. Technical Report. UNSPECIFIED.

[img] Text
IDSIA-11-05.pdf

Download (205Kb)

Actions (login required)

View Item View Item