66 citations · 175 across the 15 of their papers we have counts for
4 papers · 1 filter
Automated Proofs in Geometry : Computing Upper Bounds for the Heilbronn Problem for Triangles
Francesco De Comite, Jean-Paul Delahaye
We propose a method for computing upper bounds for the Heilbronn problem for triangles.
Scatter and regularity imply Benford's law... and more
Nicolas Gauvrit, Jean-Paul Delahaye
A random variable (r.v.) X is said to follow Benford's law if log(X) is uniform mod 1. Many experimental data sets prove to follow an approximate version of it, and so do many math…
French Roadmap for complex Systems 2008-2009
Paul Bourgine, David Chavalarias, Edith Perrier +78
This second issue of the French Complex Systems Roadmap is the outcome of the Entretiens de Cargese 2008, an interdisciplinary brainstorming session organized over one week in 2008…
On the Algorithmic Nature of the World
Hector Zenil, Jean-Paul Delahaye
We propose a test based on the theory of algorithmic complexity and an experimental evaluation of Levin's universal distribution to identify evidence in support of or in contravent…