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

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

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)

Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines.
by: Fernando Soler-Toscano, et al.
Published: (2014-01-01)

Natural Scene Statistics Mediate the Perception of Image Complexity
by: Gauvrit, N, et al.
Published: (2014)

Human behavioral complexity peaks at age 25.
by: Nicolas Gauvrit, et al.
Published: (2017-04-01)

On the Kolmogorov−Chaitin Complexity for short sequences
by: Delahaye, J, et al.
Published: (2007)

A decomposition method for global evaluation of shannon entropy and local estimations of algorithmic complexity
by: Zenil, H, et al.
Published: (2016)

An Algorithmic Information−theoretic Approach to the Behaviour of Financial Markets
by: Zenil, H, et al.
Published: (2011)

Fractal Dimension of Space−time Diagrams and the Runtime Complexity of Small Turing Machines
by: Joosten, J, et al.
Published: (2013)

Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
by: Zenil, H, et al.
Published: (2014)

Correlation of automorphism group size and topological properties with program−size complexity evaluations of graphs and complex networks
by: Zenil, H, et al.
Published: (2014)

Image characterization and classification by physical complexity
by: Zenil, H, et al.
Published: (2012)

Graph presentation of binary strings
by: Qefsere Doko Gjonbalaj, et al.
Published: (2018-06-01)

Low algorithmic complexity entropy-deceiving graphs
by: Zenil, H, et al.
Published: (2017)

A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity
by: Hector Zenil, et al.
Published: (2018-08-01)

Algorithmic complexity of motifs clusters superfamilies of networks
by: Zenil, H, et al.
Published: (2013)

Empirical Encounters with Computational Irreducibility and Unpredictability
by: Zenil, H, et al.
Published: (2012)

Approximations of algorithmic and structural complexity validate cognitive-behavioral experimental results
by: Hector Zenil, et al.
Published: (2023-01-01)

Algorithmic Complexity of Financial Motions
by: Ma, L, et al.
Published: (2014)

A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions
by: Hector Zenil
Published: (2020-05-01)

A Note on the Probability of Rectangles for Correlated Binary Strings
by: Ordentlich, Or, et al.
Published: (2021)

Correction: Primer on binary logistic regression
Published: (2022-06-01)

Algorithms on strings /
by: 244890 Crochemore, Maxime, et al.
Published: (2007)

Expected Number of Distinct Subsequences in Randomly Generated Binary Strings
by: Yonah Biers-Ariel, et al.
Published: (2018-06-01)

Super-Exponential Growth in Models of a Binary String World
by: Marco Villani, et al.
Published: (2023-01-01)

Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement
by: Lee Braine, et al.
Published: (2021-01-01)

APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING
by: Robert Susik
Published: (2017-09-01)

A fast algorithm for the string editing problem and decision graph complexity
by: Masek, William Joseph
Published: (2008)

Three subtyping algorithms for binary session types and their complexity analyses
by: Udomsrirungruang, T, et al.
Published: (2024)

A tight upper bound on the size of the antidictionary of a binary string
by: Hiroyoshi Morita, et al.
Published: (2005-01-01)

A primer in applied radiation physics /
by: 352516 Smith, F. A.
Published: (2000)

Recrystallization in string-fluid complex plasmas
by: E. Joshi, et al.
Published: (2023-03-01)

Symmetry and Correspondence of Algorithmic Complexity over Geometric, Spatial and Topological Representations
by: Hector Zenil, et al.
Published: (2018-07-01)

A Review of Graph and Network Complexity from an Algorithmic Information Perspective
by: Hector Zenil, et al.
Published: (2018-07-01)

An Efficient Algorithm to Compute the Linear Complexity of Binary Sequences
by: Amparo Fúster-Sabater, et al.
Published: (2022-03-01)

Algorithms for string and graph layout
by: Newman, Alantha.
Published: (2005)

Quantum Algorithms For String Problems
by: Jin, Ce
Published: (2023)