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