Algorithmic complexity for short binary strings applied to psychology: a primer

Documenti analoghi

• Algorithmic complexity for psychology: A user−friendly implementation of the coding theorem method
  di: Gauvrit, N, et al.
  Pubblicazione: (2015)
• Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness
  di: Delahaye, J, et al.
  Pubblicazione: (2012)
• Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
  di: Soler−Toscano, F, et al.
  Pubblicazione: (2013)
• Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines
  di: Soler−Toscano, F, et al.
  Pubblicazione: (2014)
• Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
  di: Hector Zenil, et al.
  Pubblicazione: (2015-09-01)