The following pages link to Hector Zenil (Q256718):
Displaying 33 items.
- Turing patterns with Turing machines: emergence and low-level structure formation (Q256719) (← links)
- Exploring programmable self-assembly in non-DNA based molecular computing (Q269774) (← links)
- (Q406207) (redirect page) (← links)
- Life as thermodynamic evidence of algorithmic structure in natural environments (Q406210) (← links)
- (Q504698) (redirect page) (← links)
- Fractal dimension versus process complexity (Q504699) (← links)
- A computable measure of algorithmic probability by finite approximations with an application to integer sequences (Q1693803) (← links)
- Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks (Q1782785) (← links)
- (Q2011630) (redirect page) (← links)
- Is there any real substance to the claims for a ``new computationalism''? (Q2011631) (← links)
- Algorithmic information dynamics of cellular automata (Q2086706) (← links)
- Model discovery and discrete inverse problems with cellular automata and Boolean networks (Q2086745) (← links)
- Methods and applications of algorithmic complexity. Beyond statistical lossless compression (Q2122124) (← links)
- Computable model discovery and high-level-programming approximations to algorithmic complexity (Q2163372) (← links)
- Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness (Q2249007) (← links)
- Asymptotic behavior and ratios of complexity in cellular automata (Q2866061) (← links)
- Computer Runtimes and the Length of Proofs (Q2891314) (← links)
- Le fossé de Sloane (Q3099487) (← links)
- Introducing the Computable Universe (Q4907910) (← links)
- Compression is Comprehension and the Unreasonable Effectiveness of Digital Computation in the Natural World (Q4993067) (← links)
- Rule Primality, Minimal Generating Sets, Turing-Universality and Causal Decomposition in Elementary Cellular Automata (Q5010160) (← links)
- Shortening of Proof Length is Elusive for Theorem Provers (Q5087078) (← links)
- Networks from an Information-Theoretic and Algorithmic Complexity Perspective (Q5164784) (← links)
- (Q5393490) (← links)
- (Q5396369) (← links)
- Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures (Q5413744) (← links)
- On the Kolmogorov-Chaitin Complexity for short sequences (Q5448299) (← links)
- Algorithmic Information Dynamics (Q5872465) (← links)
- Sloane’s Gap: Do Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS? (Q6081138) (← links)
- Low Algorithmic Complexity Entropy-deceiving Graphs (Q6276736) (← links)
- Computable Model Discovery and High-Level-Programming Approximations to Algorithmic Complexity (Q6386483) (← links)
- Algorithmic Information Dynamics of Cellular Automata (Q6386664) (← links)
- On sequential structures in incompressible multidimensional networks (Q6656782) (← links)
