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