Related papers: Subcomputable Schnorr Randomness
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
A state $\rho=(\rho_n)_{n=1}^{\infty}$ is a sequence such that $\rho_n$ is a density matrix on $n$ qubits. It formalizes the notion of an infinite sequence of qubits. The von Neumann entropy $H(d)$ of a density matrix $d$ is the Shannon…
We answer a question of Ambos-Spies and Ku\v{c}era in the affirmative. They asked whether, when a real is low for Schnorr randomness, it is already low for Schnorr tests.
In a prequential approach to algorithmic randomness, probabilities for the next outcome can be forecast `on the fly' without the need for fully specifying a probability measure on all possible sequences of outcomes, as is the case in the…
Computational mechanics, an approach to structural complexity, defines a process's causal states and gives a procedure for finding them. We show that the causal-state representation--an $\epsilon$-machine--is the minimal one consistent with…
Resonance counting is an intuitive and widely used tool in Random Matrix Theory and Anderson Localization. Its undoubted advantage is its simplicity: in principle, it is easily applicable to any random matrix ensemble. On the downside, the…
The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising…
Under mild assumptions, we prove that any random multifunction can be represented as the set of minimizers of an infinitely many differentiable normal integrand, which preserves the convexity of the random multifunction. We provide several…
Invariance properties of semimartingales on Lie groups under a family of random transformations are defined and investigated, generalizing the random rotations of the Brownian motion. A necessary and sufficient explicit condition…
We consider the notion of the matrix (tensor) distribution of a measurable function of several variables. On the one hand, it is an invariant of this function with respect to a certain group of transformations of variables; on the other…
We discuss the application of random projections to conic programming: notably linear, second-order and semidefinite programs. We prove general approximation results on feasibility and optimality using the framework of formally real Jordan…
The notion of random self-decomposability is generalized further. The notion is then extended to non-negative integer-valued distributions.
For the space of functions that can be approximated by linear chirps, we prove a reconstruction theorem by random sampling at arbitrary rates.
A computer code can simulate a system's propagation of variation from random inputs to output measures of quality. Our aim here is to estimate a critical output tail probability or quantile without a large Monte Carlo experiment. Instead,…
A new class of functions is presented. The structure of the algorithm, particularly the selection criteria (branching), is used to define the fundamental property of the new class. The most interesting property of the new functions is that…
We introduce the notion of almost realizability, an arithmetic generalization of realizability for integer sequences, which is the property of counting periodic points for some map. We characterize the intersection between the set of…
Although algorithmic randomness with respect to various non-uniform computable measures is well-studied, little attention has been paid to algorithmic randomness with respect to computable \emph{trivial} measures, where a measure $\mu$ on…
In this paper we introduce the notion of linear computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.
A randomised trapezoidal quadrature rule is proposed for continuous functions which enjoys less regularity than commonly required. Indeed, we consider functions in some fractional Sobolev space. Various error bounds for this randomised rule…
We propose a notion of autoreducibility for infinite time computability and explore it and its connection with a notion of randomness for infinite time machines.