Related papers: Escaping Tennenbaum's Theorem and a Strong Jump In…
A central problem in machine learning involves modeling complex data-sets using highly flexible families of probability distributions in which learning, sampling, inference, and evaluation are still analytically or computationally…
Although the G.Birkhoff Ergodic Theorem (BET) is trivial for finite spaces, this does not help in proving it for hyperfinite Loeb spaces. The proof of the BET for this case, suggested by T. Kamae, works, actually, for arbitrary probability…
This paper is an overview of results that show the Brouwer fixed-point theorem (BFPT) to be essentially non-constructive and non-computable. The main results, the counter-examples of Orevkov and Baigger, imply that there is no procedure for…
Probabilistic circuits (PCs) are models that allow exact and tractable probabilistic inference. In contrast to neural networks, they are often assumed to be well-calibrated and robust to out-of-distribution (OOD) data. In this paper, we…
With the aid of simple analytical computations for the Ehrenfest model, we clarify some basic features of macroscopic irreversibility. The stochastic character of the model allows us to give a non-ambiguous interpretation of the general…
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this…
Standard quantum mechanics employs complex Hilbert spaces, but whether complex numbers are fundamental or merely convenient has long been debated. For decades, real-valued equivalents were considered mathematically possible but cumbersome.…
The celebrated Bell's no-go theorem rules out the hidden-variable theories falling in the hypothesis of locality and causality, by requiring the theory to model the quantum correlation-at-a-distance phenomena. Here I develop an independent…
Let $N$ be normal subgroup of a finite group $G$, $p$ be a prime, $P$ be a Sylow $p$-subgroup of $G$ and $\theta$ be a $P$-invariant irreducible character of $N$. Suppose that $G/N$ is a $p$-solvable group. In this note we show that,…
We investigate the theory of thermodynamic formalism from the perspective of computable analysis, with a special focus on the computability of equilibrium states. Specifically, we develop two complementary general approaches to verify the…
In this paper we establish strong embedding theorems, in the sense of the Komlos-Major-Tusnady framework, for the performance metrics of a general class of transitory queueing models of nonstationary queueing systems. The nonstationary and…
We provide requirements on effectively enumerable topological spaces which guarantee that the Rice-Shapiro theorem holds for the computable elements of these spaces. We show that the relaxation of these requirements leads to the classes of…
In this paper, we develop the notion of entropy for uniform hypergraphs via tensor theory. We employ the probability distribution of the generalized singular values, calculated from the higher-order singular value decomposition of the…
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message $M$ can be deduced from a set of messages $\Gamma$ under the theory of blind signatures and arbitrary convergent…
Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum computer (Quantum Mechanical Computers, Richard P. Feynman, Foundations of Physics, Vol. 16, No. 6, p597-531, 1986). Feynman's answer…
Given an ideal $a \subseteq R$ in a (log) $Q$-Gorenstein $F$-finite ring of characteristic $p > 0$, we study and provide a new perspective on the test ideal $\tau(R, a^t)$ for a real number $t > 0$. Generalizing a number of known results…
We generalize Lyapunov's convexity theorem for classical (scalar-valued) measures to quantum (operator-valued) measures. In particular, we show that the range of a nonatomic quantum probability measure is a weak*-closed convex set of…
This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic including PA (Peano Arithmetic). This paper shows that P…
The principle of smooth fit is probably the most used tool to find solutions to optimal stopping problems of one-dimensional diffusions. It is important, e.g., in financial mathematical applications to understand in which kind of models and…
We review recent work that employs the framework of logical inference to establish a bridge between data gathered through experiments and their objective description in terms of human-made concepts. It is shown that logical inference…