相关论文: Variants of Solovay reducibility

We analyse a trimmed stochastic process of the form ${}^{(r)}X_t= X_t - \sum_{i=1}^r \Delta_t^{(i)}$, where $(X_t)_{t \geq 0}$ is a driftless subordinator on $\mathbb{R}$ with its jumps on $[0,t]$ ordered as $ \Delta_t^{(1)}\ge…

This paper is motivated by a conjecture that BPP can be characterized in terms of polynomial-time nonadaptive reductions to the set of Kolmogorov-random strings. In this paper we show that an approach laid out in [Allender et al] to settle…

By Solovay's celebrated completeness result on formal provability we know that the provability logic $\mathrm GL$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable…

Reasoning language models (RLMs) achieve strong performance on complex reasoning tasks, yet they still exhibit a multilingual reasoning gap, performing better in high-resource languages than in low-resource ones. While recent efforts have…

Tikhonov regularization with square-norm penalty for linear forward operators has been studied extensively in the literature. However, the results on convergence theory are based on technical proofs and difficult to interpret. It is also…

An approximation of a real is a sequence of rational numbers that converges to the real. An approximation is left-c.e. if it is computable and nondecreasing and is d.c.e. if it is computable and has bounded variation. A real is computably…

One of the key assumptions in the stability and convergence analysis of variational regularization is the ability of finding global minimizers. However, such an assumption is often not feasible when the regularizer is a black box or…

Under the continuous assumption on the generator $g$, Briand et al. [Electron. Comm. Probab. 5 (2000) 101--117] showed some connections between $g$ and the conditional $g$-expectation $({\mathcal{E}}_g[\cdot|{\mathcal{F}}_t])_{t\in[0,T]}$…

We study generalizations of Demuth's Theorem, which states that the image of a Martin-L\"of random real under a tt-reduction is either computable or Turing equivalent to a Martin-L\"of random real. We show that Demuth's Theorem holds for…

Nowadays we have many methods allowing to exploit the regularising properties of the linear part of a nonlinear dispersive equation (such as the KdV equation, the nonlinear wave or the nonlinear Schroedinger equations) in order to prove…

In this paper, we present a theoretical effort to connect the theory of program size to psychology by implementing a concrete language of thought with Turing-computable Kolmogorov complexity (LT^2C^2) satisfying the following requirements:…

Consider a sequence of i.i.d. random Lipschitz functions $\{\Psi_n\}_{n \geq 0}$. Using this sequence we can define a Markov chain via the recursive formula $R_{n+1} = \Psi_{n+1}(R_n)$. It is a well known fact that under some mild moment…

Martin-L\"of (ML)-reducibility compares $K$-trivial sets by examining the Martin-L\"of random sequences that compute them. We show that every $K$-trivial set is computable from a c.e.\ set of the same ML-degree. We investigate the interplay…

We study non-trivial translation-invariant probability measures on the space of entire functions of one complex variable. The existence (and even an abundance) of such measures was proven by Benjamin Weiss. Answering Weiss question, we find…

Coskey, Hamkins, and Miller [CHM12] proposed two possible analogues of the class of countable Borel equivalence relations in the setting of computable reducibility of equivalence relations on the computably enumerable (c.e.) sets. The first…

We characterize Martin-L\"of randomness and Schnorr randomness in terms of the merging of opinions, along the lines of the Blackwell-Dubins Theorem. After setting up a general framework for defining notions of merging randomness, we focus…

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

We derive sufficient conditions for a probability measure on a finite product space (a spin system) to satisfy a (modified) logarithmic Sobolev inequality. We establish these conditions for various examples, such as the (vertex-weighted)…

Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…

We show that the new quantum extension of Renyi's \alpha-relative entropies, introduced recently by Muller-Lennert, Dupuis, Szehr, Fehr and Tomamichel, J. Math. Phys. 54, 122203, (2013), and Wilde, Winter, Yang, Commun. Math. Phys. 331,…