| Publication | Date of Publication | Type |
|---|
| Sloane’s Gap: Do Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS? | 2023-10-25 | Paper |
| A Computable Piece of Uncomputable Art Whose Expansion May Explain the Universe in Software Space | 2023-09-01 | Paper |
| Algorithmic Information Dynamics | 2023-01-30 | Paper |
| Algorithmic information dynamics of cellular automata | 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 | 2022-08-10 | Paper |
| Shortening of Proof Length is Elusive for Theorem Provers | 2022-07-08 | Paper |
| Methods and applications of algorithmic complexity. Beyond statistical lossless compression | 2022-04-05 | Paper |
| Algorithmic Information Dynamics of Cellular Automata | 2021-12-24 | Paper |
| Computable Model Discovery and High-Level-Programming Approximations to Algorithmic Complexity | 2021-12-22 | Paper |
| Networks from an Information-Theoretic and Algorithmic Complexity Perspective | 2021-11-12 | Paper |
| Rule Primality, Minimal Generating Sets, Turing-Universality and Causal Decomposition in Elementary Cellular Automata | 2021-08-24 | Paper |
| Compression is Comprehension and the Unreasonable Effectiveness of Digital Computation in the Natural World | 2021-06-15 | Paper |
| Compression is Comprehension, and the Unreasonable Effectiveness of Digital Computation in the Natural World | 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 | 2018-09-20 | Paper |
| A computable measure of algorithmic probability by finite approximations with an application to integer sequences | 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 | 2017-01-17 | Paper |
| Low Algorithmic Complexity Entropy-deceiving Graphs | 2016-08-21 | Paper |
| Exploring programmable self-assembly in non-DNA based molecular computing | 2016-04-06 | Paper |
| Turing patterns with Turing machines: emergence and low-level structure formation | 2016-03-10 | Paper |
| Life as thermodynamic evidence of algorithmic structure in natural environments | 2014-09-08 | Paper |
| Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness | 2014-06-27 | Paper |
| Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures | 2014-04-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396369 | 2014-02-05 | Paper |
| ASYMPTOTIC BEHAVIOR AND RATIOS OF COMPLEXITY IN CELLULAR AUTOMATA | 2013-12-13 | Paper |
| Introducing the Computable Universe | 2013-02-26 | Paper |
| Computer Runtimes and the Length of Proofs | 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 |
| Le fossé de Sloane | 2011-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5393490 | 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 | 2008-03-20 | Paper |
