Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness
Main Authors: | Delahaye, J, Zenil, H |
---|---|
Formato: | Journal article |
Publicado em: |
2012
|
Registos relacionados
-
Algorithmic complexity for short binary strings applied to psychology: a primer
Por: Gauvrit, N, et al.
Publicado em: (2013) -
On the Kolmogorov−Chaitin Complexity for short sequences
Por: Delahaye, J, et al.
Publicado em: (2007) -
Uncurrying for Innermost Termination and Derivational Complexity
Por: Aart Middeldorp, et al.
Publicado em: (2011-02-01) -
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
Por: Soler−Toscano, F, et al.
Publicado em: (2013) -
Reachability Analysis of Innermost Rewriting
Por: Thomas Genet, et al.
Publicado em: (2017-03-01)