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)