| Publication | Date of Publication | Type |
|---|
On sequential structures in incompressible multidimensional networks
Parallel Processing Letters | 2025-01-03 | Paper |
Sloane’s Gap: Do Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS?
Journal of Humanistic Mathematics | 2023-10-25 | Paper |
A Computable Piece of Uncomputable Art Whose Expansion May Explain the Universe in Software Space
WSPC Book Series in Unconventional Computing | 2023-09-01 | Paper |
| Algorithmic Information Dynamics | 2023-01-30 | Paper |
Algorithmic information dynamics of cellular automata
(available as arXiv preprint) | 2022-10-25 | Paper |
| Model discovery and discrete inverse problems with cellular automata and Boolean networks | 2022-10-25 | Paper |
Computable model discovery and high-level-programming approximations to algorithmic complexity
Theoretical Computer Science | 2022-08-10 | Paper |
Shortening of proof length is elusive for theorem provers
Parallel Processing Letters | 2022-07-08 | Paper |
Methods and applications of algorithmic complexity. Beyond statistical lossless compression
Emergence, Complexity and Computation | 2022-04-05 | Paper |
Algorithmic Information Dynamics of Cellular Automata
(available as arXiv preprint) | 2021-12-24 | Paper |
Computable Model Discovery and High-Level-Programming Approximations to Algorithmic Complexity
(available as arXiv preprint) | 2021-12-22 | Paper |
| Networks from an Information-Theoretic and Algorithmic Complexity Perspective | 2021-11-12 | Paper |
| Rule primality, minimal generating sets and Turing-universality in the causal decomposition of elementary cellular automata | 2021-08-24 | Paper |
Rule primality, minimal generating sets and Turing-universality in the causal decomposition of elementary cellular automata
(available as arXiv preprint) | 2021-08-24 | Paper |
Compression is Comprehension and the Unreasonable Effectiveness of Digital Computation in the Natural World
Unravelling Complexity | 2021-06-15 | Paper |
Compression is Comprehension, and the Unreasonable Effectiveness of Digital Computation in the Natural World
(available as arXiv preprint) | 2019-04-23 | Paper |
| On incompressible multidimensional networks | 2018-12-03 | Paper |
| Algorithmic information distortions and incompressibility in uniform multidimensional networks | 2018-10-27 | Paper |
Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
Physica A | 2018-09-20 | Paper |
A computable measure of algorithmic probability by finite approximations with an application to integer sequences
Complexity | 2018-01-31 | Paper |
| Is there any real substance to the claims for a ``new computationalism? | 2017-08-04 | Paper |
Fractal dimension versus process complexity
Advances in Mathematical Physics | 2017-01-17 | Paper |
| Low Algorithmic Complexity Entropy-deceiving Graphs | 2016-08-21 | Paper |
Exploring programmable self-assembly in non-DNA based molecular computing
Natural Computing | 2016-04-06 | Paper |
Turing patterns with Turing machines: emergence and low-level structure formation
Natural Computing | 2016-03-10 | Paper |
Life as thermodynamic evidence of algorithmic structure in natural environments
Entropy | 2014-09-08 | Paper |
Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
Applied Mathematics and Computation | 2014-06-27 | Paper |
Correspondence and independence of numerical evaluations of algorithmic information measures
Computability | 2014-04-30 | Paper |
Computation and universality: Class IV versus Class III cellular automata
(available as arXiv preprint) | 2014-02-05 | Paper |
Asymptotic behavior and ratios of complexity in cellular automata
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering | 2013-12-13 | Paper |
Introducing the Computable Universe
A Computable Universe | 2013-02-26 | Paper |
Computer runtimes and the length of proofs. With an algorithmic probabilistic application to waiting times in automatic theorem proving
Computation, Physics and Beyond | 2012-06-15 | Paper |
| Tr\`es courte enqu\^ete sur l'extension non-triviale de la logique de propositions \`a la logique du premier et deuxi\`eme ordre | 2012-02-12 | Paper |
Sloane's gap
Mathématiques et sciences humaines | 2011-12-01 | Paper |
| Compression-based investigation of the dynamical properties of cellular automata and other systems | 2011-04-18 | Paper |
| Sloane's Gap. Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS | 2011-01-24 | Paper |
On the Kolmogorov-Chaitin Complexity for short sequences
(available as arXiv preprint) | 2008-03-20 | Paper |
