-
Logic in the Hyperfinite Factor: Geometry of Interaction and Complexity
This work is a study of the geometry of interaction in the hyperfinite factor introduced by Jean-Yves Girard, and of its relations with ancient constructions. We start... -
Complejidad descriptiva y computacional en máquinas de Turing pequeñas
International audience -
An Algorithmic Information-theoretic Approach to the Behaviour of Financial M...
International audience -
The Algorithmic Footprint in Empirical Data
This dataset has no description
-
Program-size versus Time Complexity Slowdown and Speed-up Phenomena in the Mi...
3rd International Workshop on Physics and Computation, Egypt, August 30-SEP 06, 2010 -
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
International audience -
The Best-partitions Problem: How to Build Meaningful Aggregations ?
The design and the debugging of large distributed AI systems require abstraction tools to build tractable macroscopic descriptions. Data aggregation can provide such...
