Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness
Κύριοι συγγραφείς: | Delahaye, J, Zenil, H |
---|---|
Μορφή: | Journal article |
Έκδοση: |
2012
|
Παρόμοια τεκμήρια
-
Algorithmic complexity for short binary strings applied to psychology: a primer
ανά: Gauvrit, N, κ.ά.
Έκδοση: (2013) -
On the Kolmogorov−Chaitin Complexity for short sequences
ανά: Delahaye, J, κ.ά.
Έκδοση: (2007) -
Uncurrying for Innermost Termination and Derivational Complexity
ανά: Aart Middeldorp, κ.ά.
Έκδοση: (2011-02-01) -
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
ανά: Soler−Toscano, F, κ.ά.
Έκδοση: (2013) -
Reachability Analysis of Innermost Rewriting
ανά: Thomas Genet, κ.ά.
Έκδοση: (2017-03-01)