Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness
Príomhchruthaitheoirí: | Delahaye, J, Zenil, H |
---|---|
Formáid: | Journal article |
Foilsithe / Cruthaithe: |
2012
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Algorithmic complexity for short binary strings applied to psychology: a primer
de réir: Gauvrit, N, et al.
Foilsithe / Cruthaithe: (2013) -
On the Kolmogorov−Chaitin Complexity for short sequences
de réir: Delahaye, J, et al.
Foilsithe / Cruthaithe: (2007) -
Uncurrying for Innermost Termination and Derivational Complexity
de réir: Aart Middeldorp, et al.
Foilsithe / Cruthaithe: (2011-02-01) -
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
de réir: Soler−Toscano, F, et al.
Foilsithe / Cruthaithe: (2013) -
Reachability Analysis of Innermost Rewriting
de réir: Thomas Genet, et al.
Foilsithe / Cruthaithe: (2017-03-01)