Comparisons between some generalizations of recursion theory

The logarithmic Minkowski problem asks for necessary and sufficient conditions for a finite Borel measure on the unit sphere so that it is the cone-volume measure of a convex

Toute utilisation commerciale ou impression systématique est constitutive d’une infrac- tion pénale.. Toute copie ou impression de ce fichier doit contenir la présente mention

Lastly, for problems with a very large number of classes, like Chinese or Japanese ideogram recognition, we suspect that the unbalance of the number of the

While the majority of the work in algorithmic randomness has fo- cused on Cantor space with the fair-coin (a.k.a. Lebesgue) measure (or in some cases Bernoulli measures), all of

The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.. L’archive ouverte pluridisciplinaire HAL, est

Upper right plot: the ChIPmix data transformed as in Vandekerkhove (2012); the solid line represents the regression line estimated by the method in this work, while the dashed line

Informatique théorique et Applications/Theoretical Informaties and Applications.. In this paper we prove that a computable infinité algebra can be specified by a single équation

We will see that this définition of convergence does not relate the complexity of a séquence of real numbers with the complexity of its limit, finding a séquence that is computable