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