Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Algorithmic complexity for sho...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
Export Ready —
Algorithmic complexity for short binary strings applied to psychology: a primer
Bibliographic Details
Main Authors:
Gauvrit, N
,
Zenil, H
,
Soler−Toscano, F
,
Delahaye, J
Format:
Journal article
Published:
2013
Holdings
Description
Similar Items
Staff View
Similar Items
Algorithmic complexity for psychology: A user−friendly implementation of the coding theorem method
by: Gauvrit, N, et al.
Published: (2015)
Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness
by: Delahaye, J, et al.
Published: (2012)
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
by: Soler−Toscano, F, et al.
Published: (2013)
Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines
by: Soler−Toscano, F, et al.
Published: (2014)
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
by: Hector Zenil, et al.
Published: (2015-09-01)