Chernov, Alexey and Schmidhuber, Juergen (2005) Prefix-like Complexities of Finite and Infinite Sequences on Generalized Turing Machines. Technical Report UNSPECIFIED
Text
IDSIA-11-05.pdf Download (210kB) |
Item Type: | Report (Technical Report) |
---|---|
Subjects: | Computer sciences |
Department/unit: | Dipartimento tecnologie innovative > Istituto Dalle Molle di studi sull’intelligenza artificiale USI-SUPSI |
Depositing User: | Corrado Valeri |
Date Deposited: | 29 Sep 2014 13:33 |
Last Modified: | 29 Sep 2014 13:33 |
URI: | http://repository.supsi.ch/id/eprint/5443 |
Actions (login required)
View Item |