Related papers: Solovay reduction and continuity

We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…

In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…

We introduce the pre-Tukey reducibility, a generalization of the Tukey reducibility between directed sets that works well in $\mathsf{ZF}$. We investigate the pre-Tukey reducibility between several $\sigma$-directed sets under assumptions…

Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…

In a previous paper, we provided a formal definition for the concept of computational irreducibility (CIR), i.e. the fact for a function f from N to N that it is impossible to compute f(n) without following approximately the same path than…

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f…

We introduce two new algebraic invariants, the (co)homological distances between continuous maps, which provide computable lower bounds for the homotopic distance and strictly refine the classical cup-length estimates. We then define the…

There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…

Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the…

We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…

An explanation to the boundness of minimal log discrepancies conjectured by V.V. Shokurov would be that the minimal log discrepancies of a variety in its closed points define a lower semi-continuous function. We check this lower…

We construct a monotone, continuous, but not absolutely continuous function whose minimal modulus of continuity is absolutely continuous. In particular, we establish that there is no equivalence between the absolute continuity of a function…

A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…

The difficulty of explaining non-local correlations in a fixed causal structure sheds new light on the old debate on whether space and time are to be seen as fundamental. Refraining from assuming space-time as given a priori has a number of…

This is a work in progress, far from being in its final form whose purpose is to investigate thoroughly the structure of Berkovich analytic curves and its relation with the semi-stable reduction theorem (of which a new proof is given here,…

Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p > 0. A subgroup of G is said to be separable in G if its global and infinitesimal centralizers have the same dimension. We study the…

Starting from the definition of the Gromov-Hausdorff distance via distortion of correspondences, we add the requirement of semicontinuity of each correspondence and its inverse. It turns out that in the case of lower semicontinuity we…

The possibility of a fundamental consistency between the basic quantum principles and reduction (so-called wave function reduction) is reexamined. The mathematical description of an organized macroscopic device is constructed explicitly as…

We construct complete sets of invariant quantities that are integrals of motion for two Hamiltonian systems obtained through a reduction procedure, thus proving that these systems are maximally superintegrable. We also discuss the reduction…