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