85 citations · 742 across the 80 of their papers we have counts for
5 papers · 1 filter
Computable Model Discovery and High-Level-Programming Approximations to Algorithmic Complexity
Vladimir Lemusa, Eduardo Acuña, Víctor Zamora +2
Motivated by algorithmic information theory, the problem of program discovery can help find candidates of underlying generative mechanisms of natural and artificial phenomena. The…
A Simplicity Bubble Problem in Formal-Theoretic Learning Systems
Felipe S. Abrahão, Hector Zenil, Fabio Porto +3
When mining large datasets in order to predict new data, limitations of the principles behind statistical machine learning pose a serious challenge not only to the Big Data deluge,…
Simulation Intelligence: Towards a New Generation of Scientific Methods
Alexander Lavin, David Krakauer, Hector Zenil +21
The original "Seven Motifs" set forth a roadmap of essential methods for the field of scientific computing, where a motif is an algorithmic method that captures a pattern of comput…
A Computable Piece of Uncomputable Art whose Expansion May Explain the Universe in Software Space
Hector Zenil
At the intersection of what I call uncomputable art and computational epistemology, a form of experimental philosophy, we find an exciting and promising area of science related to…
Emergence and algorithmic information dynamics of systems and observers
Felipe S. Abrahão, Hector Zenil
Previous work has shown that perturbation analysis in software space can produce candidate computable generative models and uncover possible causal properties from the finite descr…