default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHector Zenil
Héctor Zenil – Hector Zenil Chavez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j51]Hector Zenil, Genaro J. Martínez:
Cellular automata. Scholarpedia 19(4): 53227 (2024)- [c12]Weizi Li, Hector Zenil, Kendall Ho, Samantha Kanza:
Introduction to the Minitrack on Digitally-enabled Blood Testing in Healthcare. HICSS 2024: 3415 - [i87]Felipe S. Abrahão, Santiago Hernández-Orozco, Narsis A. Kiani, Jesper Tegnér, Hector Zenil:
Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution. CoRR abs/2403.06629 (2024) - [i86]Hector Zenil, Luan Carlos de Sena Monteiro:
Fractal spatio-temporal scale-free messaging: amplitude modulation of self-executable carriers given by the Weierstrass function's components. CoRR abs/2403.06633 (2024) - [i85]Hector Zenil, Felipe S. Abrahão:
Decoding Geometric Properties in Non-Random Data from First Information-Theoretic Principles. CoRR abs/2405.07803 (2024) - [i84]Abbi Abdel-Rehim, Hector Zenil, Oghenejokpeme I. Orhobor, Marie Fisher, Ross J. Collins, Elizabeth Bourne, Gareth W. Fearnley, Emma Tate, Holly X. Smith, Larisa N. Soldatova, Ross D. King:
Scientific Hypothesis Generation by a Large Language Model: Laboratory Validation in Breast Cancer Treatment. CoRR abs/2405.12258 (2024) - [i83]Luan Ozelim, Abicumaran Uthamacumaran, Felipe S. Abrahão, Santiago Hernández-Orozco, Narsis A. Kiani, Jesper Tegnér, Hector Zenil:
Assembly Theory Reduced to Shannon Entropy and Rendered Redundant by Naive Statistical Algorithms. CoRR abs/2408.15108 (2024) - 2023
- [i82]Hector Zenil, Alyssa M. Adams, Felipe S. Abrahão:
Optimal Spatial Deconvolution and Message Reconstruction from a Large Generative Model of Models. CoRR abs/2303.16045 (2023) - [i81]Hector Zenil, Jesper Tegnér, Felipe S. Abrahão, Alexander Lavin, Vipin Kumar, Jeremy G. Frey, Adrian Weller, Larisa N. Soldatova, Alan R. Bundy, Nicholas R. Jennings, Koichi Takahashi, Lawrence Hunter, Saso Dzeroski, Andrew Briggs, Frederick D. Gregory, Carla P. Gomes, Christopher K. I. Williams, Jon Rowe, James A. Evans, Hiroaki Kitano, Joshua B. Tenenbaum, Ross D. King:
The Future of Fundamental Science Led by Generative Closed-Loop Artificial Intelligence. CoRR abs/2307.07522 (2023) - 2022
- [b2]Hector Zenil, Fernando Soler-Toscano
, Nicolas Gauvrit:
Methods and Applications of Algorithmic Complexity - Beyond Statistical Lossless Compression. Springer 2022, ISBN 978-3-662-64983-1, pp. 3-256 - [j50]Hector Zenil, James A. R. Marshall, Jesper Tegnér:
Approximations of algorithmic and structural complexity validate cognitive-behavioral experimental results. Frontiers Comput. Neurosci. 16 (2022) - [j49]Vladimir Lemus, Eduardo Acuña-Yeomans, Víctor Zamora, Francisco Hernández Quiroz, Hector Zenil:
Computable model discovery and high-level-programming approximations to algorithmic complexity. Theor. Comput. Sci. 927: 31-41 (2022) - [c11]Hector Zenil, Yanbo Zhang, Narsis Aftab Kiani:
Model Discovery and Discrete Inverse Problems with Cellular Automata and Boolean Networks. Automata and Complexity 2022: 433-453 - [i80]Abicumaran Uthamacumaran, Felipe S. Abrhão, Narsis Aftab Kiani, Hector Zenil:
On the Salient Limitations of the Methods of Assembly Theory and their Classification of Molecular Biosignatures. CoRR abs/2210.00901 (2022) - 2021
- [j48]Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani:
Algorithmic Information Distortions in Node-Aligned and Node-Unaligned Multidimensional Networks. Entropy 23(7): 835 (2021) - [i79]Felipe S. Abrahão, Hector Zenil:
Emergence and algorithmic information dynamics of systems and observers. CoRR abs/2105.14707 (2021) - [i78]Hector Zenil:
A Computable Piece of Uncomputable Art whose Expansion May Explain the Universe in Software Space. CoRR abs/2109.08523 (2021) - [i77]Alexander Lavin, Hector Zenil, Brooks Paige, David Krakauer, Justin Gottschlich, Tim Mattson, Anima Anandkumar, Sanjay Choudry, Kamil Rocki, Atilim Günes Baydin, Carina Prunkl, Olexandr Isayev, Erik Peterson, Peter L. McMahon, Jakob H. Macke, Kyle Cranmer, Jiaxin Zhang, Haruko M. Wainwright, Adi Hanuka, Manuela Veloso, Samuel Assefa, Stephan Zheng, Avi Pfeffer:
Simulation Intelligence: Towards a New Generation of Scientific Methods. CoRR abs/2112.03235 (2021) - [i76]Vladimir Lemus, Eduardo Acuña, Víctor Zamora, Francisco Hernández Quiroz, Hector Zenil:
Computable Model Discovery and High-Level-Programming Approximations to Algorithmic Complexity. CoRR abs/2112.12197 (2021) - [i75]Felipe S. Abrahão, Hector Zenil, Fábio Porto, Klaus Wehmuth:
Algorithmic Probability of Large Datasets and the Simplicity Bubble Problem in Machine Learning. CoRR abs/2112.12275 (2021) - [i74]Hector Zenil, Alyssa M. Adams:
Algorithmic Information Dynamics of Cellular Automata. CoRR abs/2112.13177 (2021) - 2020
- [j47]Hector Zenil:
A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions. Entropy 22(6): 612 (2020) - [j46]Santiago Hernández-Orozco, Hector Zenil, Jürgen Riedel, Adam Uccello, Narsis Aftab Kiani, Jesper Tegnér:
Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces. Frontiers Artif. Intell. 3: 567356 (2020) - [j45]Andrew Schumann, Hector Zenil:
Non-Classical Logics in Unconventional Computing. Int. J. Unconv. Comput. 15(4): 237-244 (2020) - [j44]Neda Gholami, Mohammad Mahdi Dehshibi, Andrew Adamatzky, Antonio Rueda-Toicen, Hector Zenil, Mahmood Fazlali, David Masip:
A Novel Method for Reconstructing CT Images in GATE/GEANT4 with Application in Medical Imaging: A Complexity Analysis Approach. J. Inf. Process. 28: 161-168 (2020) - [j43]Santiago Hernández-Orozco, Francisco Hernández Quiroz, Hector Zenil, Wilfried Sieg:
Shortening of Proof Length is Elusive for Theorem Provers. Parallel Process. Lett. 30(4): 2050013:1-2050013:14 (2020) - [j42]Hector Zenil, Narsis Aftab Kiani, Felipe S. Abrahão, Jesper Tegnér:
Algorithmic Information Dynamics. Scholarpedia 15(7): 53143 (2020) - [c10]Haoling Zhang, Chao-Han Huck Yang, Hector Zenil, Narsis Aftab Kiani, Yue Shen, Jesper N. Tegnér:
Evolving Neural Networks through a Reverse Encoding Tree. CEC 2020: 1-10 - [c9]Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani:
An Algorithmic Information Distortion in Multidimensional Networks. COMPLEX NETWORKS (2) 2020: 520-531 - [p2]Hector Zenil:
On the Complex Behaviour of Natural and Artificial Machines and Systems. Metrics of Sensory Motor Coordination and Integration in Robots and Animals 2020: 111-125 - [e1]Hector Zenil:
Cellular Automata and Discrete Complex Systems - 26th IFIP WG 1.5 International Workshop, AUTOMATA 2020, Stockholm, Sweden, August 10-12, 2020, Proceedings. Lecture Notes in Computer Science 12286, Springer 2020, ISBN 978-3-030-61587-1 [contents] - [i73]Haoling Zhang, Chao-Han Huck Yang, Hector Zenil, Narsis Aftab Kiani, Yue Shen, Jesper N. Tegnér:
Evolving Neural Networks through a Reverse Encoding Tree. CoRR abs/2002.00539 (2020) - [i72]Hector Zenil:
A Review of Methods for Estimating Algorithmic Complexity and Beyond: Options, and Challenges. CoRR abs/2003.11044 (2020) - [i71]Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani:
An Algorithmic Information Distortion in Multidimensional Networks. CoRR abs/2009.05879 (2020)
2010 – 2019
- 2019
- [j41]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
The Thermodynamics of Network Coding, and an Algorithmic Refinement of the Principle of Maximum Entropy. Entropy 21(6): 560 (2019) - [j40]Hector Zenil, Narsis Aftab Kiani, Allan A. Zea, Jesper Tegnér:
Causal deconvolution by algorithmic generative models. Nat. Mach. Intell. 1(1): 58-66 (2019) - [j39]Hector Zenil, Liliana Badillo, Santiago Hernández-Orozco, Francisco Hernández Quiroz:
Coding-theorem like behaviour and emergence of the universal distribution from resource-bounded algorithmic probability. Int. J. Parallel Emergent Distributed Syst. 34(2): 161-180 (2019) - [p1]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
Algorithmic Information Dynamics of Emergent, Persistent, and Colliding Particles in the Game of Life. From Parallel to Emergent Computing 2019: 367-384 - [i70]Hector Zenil:
Compression is Comprehension, and the Unreasonable Effectiveness of Digital Computation in the Natural World. CoRR abs/1904.10258 (2019) - [i69]Santiago Hernández-Orozco, Hector Zenil, Jürgen Riedel, Adam Uccello, Narsis Aftab Kiani, Jesper Tegnér:
Algorithmic Probability-guided Supervised Machine Learning on Non-differentiable Spaces. CoRR abs/1910.02758 (2019) - 2018
- [j38]Santiago Hernández-Orozco, Francisco Hernández Quiroz, Hector Zenil:
Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence. Artif. Life 24(1) (2018) - [j37]Jordi Vallverdú, Òscar Castro Garcia, Richard Mayne, Max Talanov, Michael Levin, Frantisek Baluska, Yukio-Pegio Gunji, Audrey Dussutour, Hector Zenil, Andrew Adamatzky:
Slime mould: The fundamental mechanisms of biological cognition. Biosyst. 165: 57-70 (2018) - [j36]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
Symmetry and Correspondence of Algorithmic Complexity over Geometric, Spatial and Topological Representations. Entropy 20(7): 534 (2018) - [j35]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
A Review of Graph and Network Complexity from an Algorithmic Information Perspective. Entropy 20(8): 551 (2018) - [j34]Hector Zenil, Santiago Hernández-Orozco, Narsis Aftab Kiani, Fernando Soler-Toscano, Antonio Rueda-Toicen, Jesper Tegnér:
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity. Entropy 20(8): 605 (2018) - [j33]Jürgen Riedel, Hector Zenil:
Cross-boundary Behavioural Reprogrammability Reveals Evidence of Pervasive Universality. Int. J. Unconv. Comput. 13(4-5): 309-357 (2018) - [j32]Jürgen Riedel, Hector Zenil:
Rule Primality, Minimal Generating Sets and Turing-Universality in the Causal Decomposition of Elementary Cellular Automata. J. Cell. Autom. 13(5-6): 479-497 (2018) - [j31]Hector Zenil, Narsis Aftab Kiani, Ming-Mei Shang, Jesper Tegnér:
Algorithmic Complexity and Reprogrammability of Chemical Structure Networks. Parallel Process. Lett. 28(1): 1850005:1-1850005:18 (2018) - [i68]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
Parameter-free Network Sparsification and Data Reduction by Minimal Algorithmic Information Loss. CoRR abs/1802.05843 (2018) - [i67]Hector Zenil, Narsis Aftab Kiani, Ming-Mei Shang, Jesper Tegnér:
Algorithmic Complexity and Reprogrammability of Chemical Structure Networks. CoRR abs/1802.05856 (2018) - [i66]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
Algorithmic Information Dynamics of Persistent Patterns and Colliding Particles in the Game of Life. CoRR abs/1802.07181 (2018) - [i65]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
Ab initio Algorithmic Causal Deconvolution of Intertwined Programs and Networks by Generative Mechanism. CoRR abs/1802.09904 (2018) - [i64]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
Symmetry and Algorithmic Complexity of Polyominoes and Polyhedral Graphs. CoRR abs/1803.02186 (2018) - [i63]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
An Algorithmic Refinement of Maxent Induces a Thermodynamic-like Behaviour in the Reprogrammability of Generative Mechanisms. CoRR abs/1805.07166 (2018) - [i62]Neda Gholami, Mohammad Mahdi Dehshibi, Mahmood Fazlali, Antonio Rueda-Toicen, Hector Zenil, Andrew Adamatzky:
On complexity of post-processing in analyzing GATE-driven X-ray spectrum. CoRR abs/1807.09063 (2018) - [i61]Rise Ooi, Chao-Han Huck Yang, Pin-Yu Chen, Víctor M. Eguíluz, Narsis Aftab Kiani, Hector Zenil, David Gomez-Cabrero, Jesper Tegnér:
Controllability, Multiplexing, and Transfer Learning in Networks using Evolutionary Learning. CoRR abs/1811.05592 (2018) - 2017
- [j30]Yue Deng, Hector Zenil, Jesper Tegnér, Narsis Aftab Kiani:
HiDi: an efficient reverse engineering schema for large-scale dynamic regulatory network reconstruction using adaptive differentiation. Bioinform. 33(24): 3964-3972 (2017) - [j29]Fernando Soler-Toscano, Hector Zenil:
A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences. Complex. 2017: 7208216:1-7208216:10 (2017) - [j28]Hector Zenil:
Reprogramming Matter, Life, and Purpose. Int. J. Unconv. Comput. 13(3): 221-233 (2017) - [j27]Nicolas Gauvrit, Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Peter C. Brugger:
Human behavioral complexity peaks at age 25. PLoS Comput. Biol. 13(4) (2017) - [c8]Alberto Hernández-Espinosa, Francisco Hernández Quiroz, Héctor Zenil:
Is there any Real Substance to the Claims for a 'New Computationalism'? CiE 2017: 14-23 - [i60]Hector Zenil:
Reprogramming Matter, Life, and Purpose. CoRR abs/1704.00725 (2017) - [i59]Hector Zenil:
Paths to Unconventional Computing: Causality in Complexity. CoRR abs/1706.08803 (2017) - [i58]Hector Zenil, Peter Minary:
DNA Sequence Complexity Reveals Structure Beyond GC Content in Nucleosome Occupancy. CoRR abs/1708.01751 (2017) - [i57]Santiago Hernández-Orozco, Hector Zenil, Narsis Aftab Kiani:
Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, modularity, diversity explosions, and mass extinction. CoRR abs/1709.00268 (2017) - [i56]Hector Zenil, Narsis Aftab Kiani, Francesco Marabita, Yue Deng, Szabolcs Elias, Angelika Schmidt, Gordon Ball, Jesper Tegnér:
An Algorithmic Information Calculus for Causal Discovery and Reprogramming Systems. CoRR abs/1709.05429 (2017) - [i55]Hector Zenil, Liliana Badillo, Santiago Hernández-Orozco, Francisco Hernández Quiroz:
Coding-theorem Like Behaviour and Emergence of the Universal Distribution from Resource-bounded Algorithmic Probability. CoRR abs/1711.01711 (2017) - [i54]Jordi Vallverdú, Òscar Castro Garcia, Richard Mayne, Max Talanov, Michael Levin, Frantisek Baluska, Yukio-Pegio Gunji, Audrey Dussutour, Hector Zenil, Andrew Adamatzky:
Slime mould: the fundamental mechanisms of cognition. CoRR abs/1712.00414 (2017) - 2016
- [j26]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
Quantifying loss of information in network-based dimensionality reduction techniques. J. Complex Networks 4(3): 342-362 (2016) - [c7]Hector Zenil, Francisco Hernández Quiroz, Santiago Hernández-Orozco:
The Limits of Decidable States on Open-Ended Evolution and Emergence. ALIFE 2016: 200-207 - [c6]Hector Zenil:
An algorithmic-information calculus for reprogramming biological networks. BIBM 2016: 12 - [i53]Hector Zenil, Jürgen Riedel:
Asymptotic Intrinsic Universality and Reprogrammability by Behavioural Emulation. CoRR abs/1601.00335 (2016) - [i52]Santiago Hernández-Orozco, Francisco Hernández Quiroz, Hector Zenil:
The Limits of Decidable States on Open-Ended Evolution and Emergence. CoRR abs/1606.01810 (2016) - [i51]Alyssa M. Adams, Hector Zenil, Paul C. W. Davies, Sara Imari Walker:
Formal Definitions of Unbounded Evolution and Innovation Reveal Universal Mechanisms for Open-Ended Evolution in Dynamical Systems. CoRR abs/1607.01750 (2016) - [i50]Hector Zenil, Narsis Aftab Kiani:
Low Algorithmic Complexity Entropy-deceiving Graphs. CoRR abs/1608.05972 (2016) - [i49]Hector Zenil, Fernando Soler-Toscano, Narsis Aftab Kiani, Santiago Hernández-Orozco, Antonio Rueda-Toicen:
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity. CoRR abs/1609.00110 (2016) - 2015
- [j25]Leong Ting Lui, Germán Terrazas, Hector Zenil, Cameron Alexander, Natalio Krasnogor:
Complexity Measurement Based on Information Theory and Kolmogorov Complexity. Artif. Life 21(2): 205-224 (2015) - [j24]Hector Zenil:
Algorithmicity and programmability in natural computing with the Game of Life as in silico case study. J. Exp. Theor. Artif. Intell. 27(1): 109-121 (2015) - [j23]Héctor Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit:
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility. PeerJ Comput. Sci. 1: e23 (2015) - [c5]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
Numerical Investigation of Graph Spectra and Information Interpretability of Eigenvalues. IWBBIO (2) 2015: 395-405 - [c4]Jakub Olczak, Narsis Aftab Kiani, Hector Zenil, Jesper Tegnér:
Topological Evaluation of Methods for Reconstruction of Genetic Regulatory Networks. SITIS 2015: 468-473 - [i48]Nicolas Gauvrit, Hector Zenil, Jesper Tegnér:
The Information-theoretic and Algorithmic Approach to Human, Animal and Artificial Cognition. CoRR abs/1501.04242 (2015) - [i47]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
Numerical Investigation of Graph Spectra and Information Interpretability of Eigenvalues. CoRR abs/1501.06080 (2015) - [i46]Fernando Soler-Toscano, Hector Zenil:
A Computable Measure of Algorithmic Probability by Finite Approximations. CoRR abs/1504.06240 (2015) - [i45]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
Quantifying Loss of Information in Network-based Dimensionality Reduction Techniques. CoRR abs/1504.06249 (2015) - [i44]Santiago Hernández-Orozco, Francisco Hernández Quiroz, Hector Zenil, Wilfried Sieg:
Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value. CoRR abs/1506.04349 (2015) - [i43]Héctor Zenil, Angelika Schmidt, Jesper Tegnér:
Causality, Programmability and Information Biology. CoRR abs/1508.06538 (2015) - [i42]Nicolas Gauvrit, Fernando Soler-Toscano, Hector Zenil:
Natural scene statistics mediate the perception of image complexity. CoRR abs/1509.03970 (2015) - [i41]Hector Zenil, James A. R. Marshall, Jesper Tegnér:
Approximations of Algorithmic and Structural Complexity Validate Cognitive-behavioural Experimental Results. CoRR abs/1509.06338 (2015) - [i40]Jürgen Riedel, Hector Zenil:
Cross-boundary Behavioural Reprogrammability of Cellular Automata from Emulation Networks. CoRR abs/1510.01671 (2015) - [i39]Narsis Aftab Kiani, Hector Zenil, Jakub Olczak, Jesper Tegnér:
Evaluating Network Inference Methods in Terms of Their Ability to Preserve the Topology and Complexity of Genetic Networks. CoRR abs/1512.01088 (2015) - [i38]Alyssa M. Adams, Hector Zenil, Eduardo Hermo Reyes, Joost J. Joosten:
Interacting Behavior and Emerging Complexity. CoRR abs/1512.07450 (2015) - 2014
- [i37]Hector Zenil:
Turing Minimalism and Complexity. CoRR abs/1401.3613 (2014) - [i36]Hector Zenil:
Levels of Abstraction and the Apparent Contradictory Philosophical Legacy of Turing and Shannon. CoRR abs/1402.1099 (2014) - [i35]Nicolas Gauvrit, Henrik Singmann, Fernando Soler-Toscano, Hector Zenil:
Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method. CoRR abs/1409.4080 (2014) - [i34]Daniel Wilson-Nunn, Hector Zenil:
On the Complexity and Behaviour of Cryptocurrencies Compared to Other Markets. CoRR abs/1411.1924 (2014) - [i33]Hector Zenil:
Quantifying Natural and Artificial Intelligence in Robots and Natural Systems with an Algorithmic Behavioural Test. CoRR abs/1412.6703 (2014) - 2013
- [j22]Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit:
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures. Comput. 2(2): 125-140 (2013) - [j21]Hector Zenil, Elena Villarreal Zapata:
Asymptotic Behavior and ratios of Complexity in Cellular Automata. Int. J. Bifurc. Chaos 23(9) (2013) - [j20]Hector Zenil:
Turing patterns with Turing machines: emergence and low-level structure formation. Nat. Comput. 12(2): 291-303 (2013) - [j19]Germán Terrazas, Hector Zenil, Natalio Krasnogor:
Exploring programmable self-assembly in non-DNA based molecular computing. Nat. Comput. 12(4): 499-515 (2013) - [j18]Hector Zenil, James A. R. Marshall:
Ubiquity symposium: Evolutionary computation and the processes of life: some computational aspects of essential properties of evolution and life. Ubiquity 2013(April): 1:1-1:16 (2013) - [c3]Hector Zenil, Narsis Aftab Kiani, Jesper Tegnér:
Algorithmic complexity of motifs clusters superfamilies of networks. BIBM 2013: 74-76 - [c2]Hector Zenil, Gordon Ball, Jesper Tegnér:
Testing Biological Models for Non-linear Sensitivity with a Programmability Test. ECAL 2013: 1222-1223 - [i32]Hector Zenil:
A Behavioural Foundation for Natural Computing and a Programmability Test. CoRR abs/1303.5887 (2013) - [i31]Hector Zenil, Elena Villarreal Zapata:
Asymptotic Behaviour and Ratios of Complexity in Cellular Automata. CoRR abs/1304.2816 (2013) - [i30]Hector Zenil, Fernando Soler-Toscano, Kamaludin Dingle, Ard A. Louis:
Graph Automorphism and Topological Characterization of Synthetic and Natural Complex Networks by Information Content. CoRR abs/1306.0322 (2013) - [i29]Hector Zenil:
Turing, Randomness and Economics. CoRR abs/1309.1418 (2013) - [i28]Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil:
Fractal dimension versus computational complexity. CoRR abs/1309.1779 (2013) - [i27]Germán Terrazas, Hector Zenil, Natalio Krasnogor:
Exploring Programmable Self-Assembly in Non-DNA based Molecular Computing. CoRR abs/1309.6449 (2013) - 2012
- [j17]Jean-Paul Delahaye, Hector Zenil:
Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness. Appl. Math. Comput. 219(1): 63-77 (2012) - [j16]Hector Zenil, Jean-Paul Delahaye, Cédric Gaucherel:
Image characterization and classification by physical complexity. Complex. 17(3): 26-42 (2012) - [j15]Hector Zenil:
On the Dynamic Qualitative Behavior of Universal Computation. Complex Syst. 20(3) (2012) - [j14]Héctor Zenil, Carlos Gershenson, James A. R. Marshall, David A. Rosenblueth:
Life as Thermodynamic Evidence of Algorithmic Structure in Natural Environments. Entropy 14(11): 2173-2191 (2012) - [j13]Hector Zenil:
Information Theory and Computational Thermodynamics: Lessons for Biology from Physics. Inf. 3(4): 739-750 (2012) - [j12]Genaro Juárez Martínez, Juan Carlos Seck Tuoh Mora, Hector Zenil:
Computation and Universality: Class IV versus Class III Cellular Automata. J. Cell. Autom. 7(5-6): 393-430 (2012) - [j11]Hector Zenil, Fernando Soler-Toscano, Joost J. Joosten:
Empirical Encounters with Computational Irreducibility and Unpredictability. Minds Mach. 22(3): 149-165 (2012) - [c1]Hector Zenil:
Computer Runtimes and the Length of Proofs - With an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving. Computation, Physics and Beyond 2012: 224-240 - [i26]Hector Zenil:
On the Dynamic Qualitative Behaviour of Universal Computation. CoRR abs/1201.0824 (2012) - [i25]Hector Zenil:
Computer Runtimes and the Length of Proofs: On an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving. CoRR abs/1201.0825 (2012) - [i24]Hector Zenil, James A. R. Marshall:
Some Computational Aspects of Essential Properties of Evolution and Life. CoRR abs/1206.0375 (2012) - [i23]Hector Zenil:
Introducing the Computable Universe. CoRR abs/1206.0376 (2012) - [i22]Genaro Juárez Martínez, Juan Carlos Seck Tuoh Mora, Hector Zenil:
Wolfram's Classification and Computation in Cellular Automata Classes III and IV. CoRR abs/1208.2456 (2012) - [i21]Hector Zenil:
Turing Patterns with Turing Machines: Emergence and Low-level Structure Formation. CoRR abs/1210.1572 (2012) - [i20]Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit:
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines. CoRR abs/1211.1302 (2012) - [i19]Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit:
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures. CoRR abs/1211.4891 (2012) - [i18]Hector Zenil:
What is Nature-like Computation? A Behavioural Approach and a Notion of Programmability. CoRR abs/1211.5322 (2012) - [i17]Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit:
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility. CoRR abs/1212.6745 (2012) - 2011
- [b1]Hector Zenil:
Une approche expérimentale à la théorie algorithmique de la complexité. Lille University of Science and Technology, France, 2011 - [j10]Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil:
Program-size versus Time Complexity Slowdown and Speed-up Phenomena in the Micro-cosmos of Small Turing Machines. Int. J. Unconv. Comput. 7(5): 353-387 (2011) - [i16]Jean-Paul Delahaye, Hector Zenil:
Numerical Evaluation of Algorithmic Complexity for Short Strings: A Glance into the Innermost Structure of Randomness. CoRR abs/1101.4795 (2011) - [i15]Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil:
Program-Size versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines. CoRR abs/1102.5389 (2011) - [i14]Hector Zenil, Fernando Soler-Toscano, Joost J. Joosten:
Empirical Encounters with Computational Irreducibility and Unpredictability. CoRR abs/1104.3421 (2011) - [i13]Nicolas Gauvrit, Hector Zenil, Jean-Paul Delahaye:
Assessing Cognitive Randomness: A Kolmogorov Complexity Approach. CoRR abs/1106.3059 (2011) - [i12]Hector Zenil, Jean-Paul Delahaye:
Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas. CoRR abs/1108.5387 (2011) - [i11]Hector Zenil:
The World is Either Algorithmic or Mostly Random. CoRR abs/1109.2237 (2011) - [i10]Hector Zenil:
An Algorithmic Approach to Information and Meaning. CoRR abs/1109.3887 (2011) - 2010
- [j9]Hector Zenil:
Compression-Based Investigation of the Dynamical Properties of Cellular Automata and Other Systems. Complex Syst. 19(1) (2010) - [i9]Hector Zenil, Jean-Paul Delahaye, Cédric Gaucherel:
Image information content characterization and classification by physical complexity. CoRR abs/1006.0051 (2010) - [i8]Hector Zenil, Jean-Paul Delahaye:
An algorithmic information-theoretic approach to the behaviour of financial markets. CoRR abs/1008.1846 (2010) - [i7]Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil:
Complejidad descriptiva y computacional en máquinas de Turing pequeñas. CoRR abs/1010.1328 (2010)
2000 – 2009
- 2009
- [i6]Hector Zenil, Jean-Paul Delahaye:
On the Algorithmic Nature of the World. CoRR abs/0906.3554 (2009) - [i5]Hector Zenil:
Compression-based investigation of the dynamical properties of cellular automata and other systems. CoRR abs/0910.4042 (2009) - 2008
- [i4]Jean-Paul Delahaye, Hector Zenil:
Towards a stable definition of Kolmogorov-Chaitin complexity. CoRR abs/0804.3459 (2008) - 2007
- [i3]Jean-Paul Delahaye, Héctor Zenil:
On the Kolmogorov-Chaitin Complexity for short sequences. CoRR abs/0704.1043 (2007) - 2006
- [i2]Hector Zenil, Francisco Hernández Quiroz:
On the possible Computational Power of the Human Mind. CoRR abs/cs/0605065 (2006) - [i1]Hector Zenil:
On Universality in Real Computation. CoRR abs/cs/0608094 (2006) - 2005
- [j8]Hector Zenil Chavez:
JavaServer Faces: An Excellent Learning Tool. IEEE Distributed Syst. Online 6(2) (2005) - 2004
- [j7]Hector Zenil Chavez:
Applied Parallel Computing. IEEE Distributed Syst. Online 5(3) (2004) - [j6]Hector Zenil Chavez:
Artificial Intelligence Profits from Biological Lessons. IEEE Distributed Syst. Online 5(5) (2004) - [j5]Hector Zenil Chavez:
Security Fundamentals. IEEE Distributed Syst. Online 5(6) (2004) - [j4]Hector Zenil Chavez:
Getting to Know Your Enemy. IEEE Distributed Syst. Online 5(7) (2004) - 2003
- [j3]Héctor Zenil:
How to Secure Your Enterprise (A review of Securing Business Information: Strategies to Protect the Enterprise and Its Network by F. Christian Byrnes and Dale Kutnick). IEEE Distributed Syst. Online 4(3) (2003) - [j2]Hector Zenil Chavez:
How to Develop Enterprise-Secure Java Applications Learning Risks (A review of Hacking Exposed J2EE and Java, Developing Secure Applications with Java Technology by Art Taylor, Brian Buege, and Randy Layman). IEEE Distributed Syst. Online 4(5) (2003) - 2002
- [j1]Héctor Zenil:
Book Review: Good JavaServer Pages Introduction (A review of Web Development with JavaServer Pages, 2nd edition by Duane K. Fields and Mark A. Kolb). IEEE Distributed Syst. Online 3(6) (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-01 20:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
