66 citations · 175 across the 15 of their papers we have counts for
17 papers
Updated physics performance of the ESSnuSB experiment
A. Alekou, E. Baussan, N. Blaskovic Kraljevic +48
In this paper, we present the physics performance of the ESSnuSB experiment in the standard three flavor scenario using the updated neutrino flux calculated specifically for the ES…
Organized Complexity: is Big History a Big Computation?
Jean-Paul Delahaye, Clement Vidal
The concept of "logical depth" introduced by Charles H. Bennett (1988) seems to capture, at least partially, the notion of organized complexity, so central in big history. More pre…
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility
Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye +1
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating -dimensional…
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye +1
We show that real-value approximations of Kolmogorov-Chaitin (K_m) using the algorithmic Coding theorem as calculated from the output frequency of a large set of small deterministi…
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines
Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye +1
Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approxima…
Unpredictability and Computational Irreducibility
Herve Zwirn, Jean-Paul Delahaye
We explore several concepts for analyzing the intuitive notion of computational irreducibility and we propose a robust formal definition, first in the field of cellular automata an…