Showing 1–20 of 20 results
/ Date/ Name
Feb 26, 2011Program-Size Versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing MachinesOct 7, 2010Complejidad descriptiva y computacional en maquinas de Turing pequenasFeb 14, 2019Which is the least complex explanation? Abduction and complexitySep 14, 2015Natural scene statistics mediate the perception of image complexitySep 14, 2014Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem methodJun 15, 2011Algorithmic Complexity for Short Binary Strings Applied to Psychology: A PrimerNov 6, 2012Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing MachinesJul 22, 2012A colouring protocol for the generalized Russian cards problemSep 6, 2013Fractal dimension versus process complexityApr 18, 2011Empirical Encounters with Computational Irreducibility and UnpredictabilityNov 1, 2011A secure additive protocol for card playersDec 30, 2012Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by CompressibilityJan 18, 2013A geometric protocol for cryptography with cardsJun 3, 2013Correlation of Automorphism Group Size and Topological Properties with Program-size Complexity Evaluations of Graphs and Complex NetworksJul 4, 2015Forgetting complex propositionsApr 23, 2015A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer SequencesNov 20, 2012Correspondence and Independence of Numerical Evaluations of Algorithmic Information MeasuresSep 20, 2022Structural stability of invasion graphs for Lotka--Volterra systemsSep 1, 2016A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic ComplexityJul 20, 2025A meta-modal logic for bisimulations