Hector Zenil : Publications

Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines

Fernando Soler−Toscano‚ Hector Zenil‚ Jean−Paul Delahaye and Nicolas Gauvrit

In PLoS ONE. Vol. 9(5): e96223‚ 2014. 2014.

Details about Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines | BibTeX data for Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines

Natural Scene Statistics Mediate the Perception of Image Complexity

N. Gauvrit‚ F. Soler−Toscano and H. Zenil

In Visual Cognition. Vol. 22. Pages 1084−1091. 2014.

Details about Natural Scene Statistics Mediate the Perception of Image Complexity | BibTeX data for Natural Scene Statistics Mediate the Perception of Image Complexity

Algorithmic Complexity of Financial Motions

L. Ma‚ O. Brandouy‚ J.−P. and H. Zenil

In Research in International Business and Finance. Vol. 30. Pages 336−347. 2014.

Details about Algorithmic Complexity of Financial Motions | BibTeX data for Algorithmic Complexity of Financial Motions

Sparsity of Non−trivial Proving Speed−up in Random Systems of Propositional Calculus

S. Hernandez−Orozco‚ F. Hernandez−Quiroz and H. Zenil

In Paola Bonizzoni‚ Vasco Brattka and Benedikt Lowe, editors, The Nature of Computation‚ Logic‚ Algorithms‚ Applications; 9th Conference on Computability in Europe‚ CiE 2013. 2013.

Details about Sparsity of Non−trivial Proving Speed−up in Random Systems of Propositional Calculus | BibTeX data for Sparsity of Non−trivial Proving Speed−up in Random Systems of Propositional Calculus

Irreducibility and Computational Equivalence: Ten Years After the Publication of Wolfram's A New Kind of Science‚ Series: Emergence‚ Complexity and Computation

H. Zenil (ed).

Vol. 2. Springer. 2013.

Details about Irreducibility and Computational Equivalence: Ten Years After the Publication of Wolfram's A New Kind of Science‚ Series: Emergence‚ Complexity and Computation | BibTeX data for Irreducibility and Computational Equivalence: Ten Years After the Publication of Wolfram's A New Kind of Science‚ Series: Emergence‚ Complexity and Computation

Algorithmic complexity of motifs clusters superfamilies of networks

Hector Zenil‚ Narsis A. Kiani and Jesper Tegnér

In Guo−Zheng Li‚ Sunghoon Kim‚ Michael Hughes‚ Geoffrey J. McLachlan‚ Hongye Sun‚ Xiaohua Hu‚ Habtom W. Ressom‚ Baoyan Liu and Michael N. Liebman, editors, 2013 IEEE International Conference on Bioinformatics and Biomedicine‚ Shanghai‚ China‚ December 18−21‚ 2013. Pages 74–76. IEEE. 2013.

Details about Algorithmic complexity of motifs clusters superfamilies of networks | BibTeX data for Algorithmic complexity of motifs clusters superfamilies of networks | DOI (10.1109/BIBM.2013.6732768) | Link to Algorithmic complexity of motifs clusters superfamilies of networks

Exploring programmable self−assembly in non−DNA based molecular computing

German Terrazas‚ Hector Zenil and Natalio Krasnogor

In Natural Computing. Vol. 12. No. 4. Pages 499–515. 2013.

Details about Exploring programmable self−assembly in non−DNA based molecular computing | BibTeX data for Exploring programmable self−assembly in non−DNA based molecular computing | DOI (10.1007/s11047-013-9397-2) | Link to Exploring programmable self−assembly in non−DNA based molecular computing

Asymptotic Behavior and ratios of Complexity in Cellular Automata

Hector Zenil and Elena Villarreal Zapata

In I. J. Bifurcation and Chaos. Vol. 23. No. 9. 2013.

Details about Asymptotic Behavior and ratios of Complexity in Cellular Automata | BibTeX data for Asymptotic Behavior and ratios of Complexity in Cellular Automata | DOI (10.1142/S0218127413501599) | Link to Asymptotic Behavior and ratios of Complexity in Cellular Automata

Turing patterns with Turing machines: emergence and low−level structure formation

Hector Zenil

In Natural Computing. Vol. 12. No. 2. Pages 291–303. 2013.

Details about Turing patterns with Turing machines: emergence and low−level structure formation | BibTeX data for Turing patterns with Turing machines: emergence and low−level structure formation | DOI (10.1007/s11047-013-9363-z) | Link to Turing patterns with Turing machines: emergence and low−level structure formation

Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures

Fernando Soler−Toscano‚ Hector Zenil‚ Jean−Paul Delahaye and Nicolas Gauvrit

In Computability. Vol. 2. No. 2. Pages 125–140. 2013.

Details about Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures | BibTeX data for Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures | DOI (10.3233/COM-13019) | Link to Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures

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

N. Gauvrit‚ H. Zenil‚ F. Soler−Toscano and J.−P. Delahaye

In Behavior Research Methods. Vol. 46−3. 2013.

Details about Algorithmic complexity for short binary strings applied to psychology: a primer | BibTeX data for Algorithmic complexity for short binary strings applied to psychology: a primer

A Computable Universe: Understanding Computation & Exploring Nature As Computation (with a Foreword by Sir Roger Penrose)

H. Zenil (ed.).

Springer. 2011.

Details about A Computable Universe: Understanding Computation & Exploring Nature As Computation (with a Foreword by Sir Roger Penrose) | BibTeX data for A Computable Universe: Understanding Computation & Exploring Nature As Computation (with a Foreword by Sir Roger Penrose)

Computer Runtimes and the Length of Proofs − With an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving

Hector Zenil

In Michael J. Dinneen‚ Bakhadyr Khoussainov and André Nies, editors, Computation‚ Physics and Beyond − International Workshop on Theoretical Computer Science‚ WTCS 2012‚ Dedicated to Cristian S. Calude on the Occasion of His 60th Birthday‚ Auckland‚ New Zealand‚ February 21−24‚ 2012‚ Revised Selected and Invited Papers. Vol. 7160 of Lecture Notes in Computer Science. Pages 224–240. Springer. 2012.

Details about Computer Runtimes and the Length of Proofs − With an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving | BibTeX data for Computer Runtimes and the Length of Proofs − With an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving | DOI (10.1007/978-3-642-27654-5) | Link to Computer Runtimes and the Length of Proofs − With an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving

Randomness Through Computation: Some Answers‚ More Questions

H. Zenil (ed.).

World Scientific Publishing Company/Imperial College Press. 2011.

Details about Randomness Through Computation: Some Answers‚ More Questions | BibTeX data for Randomness Through Computation: Some Answers‚ More Questions

Fractal Dimension as an Indication of the Terminating Runtime of Discrete Dynamical Systems

F. Soler−Toscano J.J. Joosten H. Zenil

In S. Thurner and M. Szell (eds), editors, Proceedings of the European Conference on Complex Systems (ECCS'11). Löcker Verlag. 2011.

Details about Fractal Dimension as an Indication of the Terminating Runtime of Discrete Dynamical Systems | BibTeX data for Fractal Dimension as an Indication of the Terminating Runtime of Discrete Dynamical Systems

Empirical Encounters with Computational Irreducibility and Unpredictability

Hector Zenil‚ Fernando Soler−Toscano and Joost J. Joosten

In Minds and Machines. Vol. 22. No. 3. Pages 149–165. 2012.

Details about Empirical Encounters with Computational Irreducibility and Unpredictability | BibTeX data for Empirical Encounters with Computational Irreducibility and Unpredictability | DOI (10.1007/s11023-011-9262-y) | Link to Empirical Encounters with Computational Irreducibility and Unpredictability

Image characterization and classification by physical complexity

Hector Zenil‚ Jean−Paul Delahaye and Cédric Gaucherel

In Complexity. Vol. 17. No. 3. Pages 26–42. 2012.

Details about Image characterization and classification by physical complexity | BibTeX data for Image characterization and classification by physical complexity | DOI (10.1002/cplx.20388) | Link to Image characterization and classification by physical complexity

Life as Thermodynamic Evidence of Algorithmic Structure in Natural Environments

Héctor Zenil‚ Carlos Gershenson‚ James A. R. Marshall and David A. Rosenblueth

In Entropy. Vol. 14. No. 11. Pages 2173–2191. 2012.

Details about Life as Thermodynamic Evidence of Algorithmic Structure in Natural Environments | BibTeX data for Life as Thermodynamic Evidence of Algorithmic Structure in Natural Environments | DOI (10.3390/e14112173) | Link to Life as Thermodynamic Evidence of Algorithmic Structure in Natural Environments

Computation and Universality: Class IV versus Class III Cellular Automata

Genaro Juárez Martínez‚ Juan Carlos Seck Tuoh Mora and Hector Zenil

In J. Cellular Automata. Vol. 7. No. 5−6. Pages 393–430. 2012.

Details about Computation and Universality: Class IV versus Class III Cellular Automata | BibTeX data for Computation and Universality: Class IV versus Class III Cellular Automata | Link to Computation and Universality: Class IV versus Class III Cellular Automata

A Behavioural Foundation for Natural Computing and a Programmability Test

H. Zenil

In Computing Nature: Turing Centenary Perspective‚ SAPERE. Vol. 7. Pages 87–113. Springer Verlag. 2013.

Details about A Behavioural Foundation for Natural Computing and a Programmability Test | BibTeX data for A Behavioural Foundation for Natural Computing and a Programmability Test

Fractal Dimension of Space−time Diagrams and the Runtime Complexity of Small Turing Machines

J. J. Joosten‚ F. Soler−Toscano and H. Zenil

In T. Neary and M. Cook, editors, Machines‚ Computations and Universality (MCU 2013)‚ EPTCS 128. Pages 29−30. 10, DOI. 2013.

Details about Fractal Dimension of Space−time Diagrams and the Runtime Complexity of Small Turing Machines | BibTeX data for Fractal Dimension of Space−time Diagrams and the Runtime Complexity of Small Turing Machines

How Nature Works‚ Complexity in Interdisciplinary Research and Applications‚ Series: Emergence‚ Complexity and Computation

I. Zelinka‚ A. Sanayei‚ H. Zenil and O. E. Rossler (eds).

Vol. 5. Springer. 2013.

Details about How Nature Works‚ Complexity in Interdisciplinary Research and Applications‚ Series: Emergence‚ Complexity and Computation | BibTeX data for How Nature Works‚ Complexity in Interdisciplinary Research and Applications‚ Series: Emergence‚ Complexity and Computation

Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness

Jean−Paul Delahaye and Hector Zenil

In Applied Mathematics and Computation. Vol. 219. No. 1. Pages 63–77. 2012.

Details about Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness | BibTeX data for Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness | DOI (10.1016/j.amc.2011.10.006) | Link to Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness

An Algorithmic Information−theoretic Approach to the Behaviour of Financial Markets

H. Zenil and J.−P. Delahaye

In Journal of Economic Surveys. Vol. 25−3. Pages 431−463. 2011.

Details about An Algorithmic Information−theoretic Approach to the Behaviour of Financial Markets | BibTeX data for An Algorithmic Information−theoretic Approach to the Behaviour of Financial Markets

Program−size versus Time complexity‚ Slowdown and speed−up phenomena in the micro−cosmos of small Turing machines

H. Zenil J.J. Joosten F. Soler−Toscano

In H. Guerra (ed), editor, Proceedings of Physics and Computation 2010‚ CAMIT‚ 3rd International Workshop on Physics and Computation. 2010.

Details about Program−size versus Time complexity‚ Slowdown and speed−up phenomena in the micro−cosmos of small Turing machines | BibTeX data for Program−size versus Time complexity‚ Slowdown and speed−up phenomena in the micro−cosmos of small Turing machines

On the Algorithmic Nature of the World

J.−P. Delahaye H. Zenil

In G. Dodig−Crnkovic and M. Burgin (eds), editors, Information and Computation. World Scientific Publishing Company. 2010.

Details about On the Algorithmic Nature of the World | BibTeX data for On the Algorithmic Nature of the World

On the Kolmogorov−Chaitin Complexity for short sequences

J.−P. Delahaye and H. Zenil

In C.S. Calude, editor, Randomness and Complexity: From Leibniz to Chaitin. World Scientific. 2007.

Details about On the Kolmogorov−Chaitin Complexity for short sequences | BibTeX data for On the Kolmogorov−Chaitin Complexity for short sequences

On the possible computational power of the human mind

Hector Zenil and Francisco Hernandez−Quiroz

In Carlos Gershenson‚ Dierdrik Aerts and Bruce Edmunds, editors, Philosophy and Complexity: Essays on Epistemology‚ Evolution and Emergence. World Scientific. 2006.

Details about On the possible computational power of the human mind | BibTeX data for On the possible computational power of the human mind | Link to On the possible computational power of the human mind

Applied Parallel Computing

Hector Zenil Chavez

In IEEE Distributed Systems Online. Vol. 5. No. 3. 2004.

Details about Applied Parallel Computing | BibTeX data for Applied Parallel Computing | DOI (10.1109/MDSO.2004.1285883) | Link to Applied Parallel Computing