Algorithmic complexity for psychology: A user−friendly implementation of the coding theorem method

Algorithmic complexity for psychology: A user−friendly implementation of the coding theorem method

Bibliographic Details
Main Authors:	Gauvrit, N, Singmann, H, Soler−Toscano, F, Zenil, H
Format:	Journal article
Published:	2015

Similar Items

Algorithmic complexity for short binary strings applied to psychology: a primer
by: Gauvrit, N, et al.
Published: (2013)

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

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)

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

Computer Runtimes and the Length of Proofs − With an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving
by: Zenil, H
Published: (2012)

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)

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

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

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

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

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

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

Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness
by: Delahaye, J, et al.
Published: (2012)

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

The Thermodynamics of Network Coding, and an Algorithmic Refinement of the Principle of Maximum Entropy
by: Hector Zenil, et al.
Published: (2019-06-01)

Coding theorems of information theory/
by: 412357 Wolfowitz, Jacob
Published: (1964)

A possibilistic no-go theorem on the Wigner’s friend paradox
by: Marwan Haddara, et al.
Published: (2023-01-01)

A user-friendly Bees Algorithm for continuous and combinatorial optimisation
by: Asrul Harun Ismail, et al.
Published: (2023-12-01)

Research and Implementation of High-Efficiency and Low-Complexity LDPC Coding Algorithm
by: Xiong Liao, et al.
Published: (2023-09-01)

Non-user-friendly
by: Tomasz Hollanek
Published: (2019-08-01)

Touch or click friendly: Towards adaptive user interfaces for complex applications.
by: Ibrar Hussain, et al.
Published: (2024-01-01)

Program−size versus Time complexity‚ Slowdown and speed−up phenomena in the micro−cosmos of small Turing machines
by: Soler−Toscano, H
Published: (2010)

Recommending Friends in Social Networks By Users\' Profiles And Using Classification Algorithms
by: Paria Dashtizadeh, et al.
Published: (2018-03-01)

Algorithmic Meta−Theorems
by: Kreutzer, S
Published: (2008)

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

User-friendly in software development
by: Srinoorini Mohamad Eunos.
Published: (2009)

Frankl-Rödl-type theorems for codes and permutations
by: Keevash, P, et al.
Published: (2016)

Coding theorems for discrete source-channel pairs.
by: Pilc, Randolph John
Published: (2005)

Asymptotic Behavior and ratios of Complexity in Cellular Automata
by: Zenil, H, et al.
Published: (2013)

Friend/followee recommendation system for users based on interests : advanced AI algorithms
by: Ailesh Sethu Piramanayagam
Published: (2012)

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

Determine the Close Friends for Twitter Users by Analyzing Users
by: Haydar Safi, et al.
Published: (2016-12-01)

Vanishing theorems on complex manifolds /
by: 184044 Shiffman, Bernard, et al.
Published: (1985)

An incompressibility theorem for automatic complexity
by: Bjørn Kjos-Hanssen
Published: (2021-01-01)

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

Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution
by: Abrahão, FS, et al.
Published: (2024)

Finding short and implementation-friendly addition chains with evolutionary algorithms
by: Coello, Carlos A C, et al.
Published: (2018)