Related papers: Escaping Tennenbaum's Theorem and a Strong Jump In…

This paper studies large sample properties of a Bayesian approach to inference about slope parameters $\gamma$ in linear regression models with a structural break. In contrast to the conventional approach to inference about $\gamma$ that…

We describe a "slow" version of the hierarchy of uniform reflection principles over Peano Arithmetic ($\mathbf{PA}$). These principles are unprovable in Peano Arithmetic (even when extended by usual reflection principles of lower…

Assuming projective determinacy, we extend Spector's strong version of the Spector-Gandy Theorem to all odd levels of the projective hierarchy: Theorem. For every space $X$ which is a finite product of the natural numbers $N$ and Baire…

We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…

Turing machines and spin models share a notion of universality according to which some simulate all others. Is there a theory of universality that captures this notion? We set up a categorical framework for universality which includes as…

For the importance of differentiation theorems in metric spaces (starting with Pansu Rademacher type theorem in Carnot groups) and relations with rigidity of embeddings see the section 1.2 in Cheeger and Kleiner paper arXiv:math/0611954 and…

Quantum mechanics is known to provide significant improvements in information processing tasks when compared to classical models. These advantages range from computational speeds-up to security improvements. A key question is where these…

In this paper we address the question as to what extent the quantum-mechanical nature of the process is relevant for teleportation of A spin-1/2 state. For this purpose we analyze the possibility of underpinning teleportation with a…

We show that there exists a bitsequence that is not computably random for which its odd bits are computably random and its even bits are computably random relative to the odd bits. This implies that the uniform variant of van Lambalgen's…

In this paper, we address the critical need for interpretable and uncertainty-aware machine learning models in the context of online learning for high-risk industries, particularly cyber-security. While deep learning and other complex…

Landauer's Principle that information loss from a computation implies entropy increase can be rigorously proved from mathematical physics. However, carefully examining its detailed formulation reveals that the traditional identification of…

The basic problem in the PAC model of computational learning theory is to determine which hypothesis classes are efficiently learnable. There is presently a dearth of results showing hardness of learning problems. Moreover, the existing…

When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel's notion of a mechanistic theory is…

In this paper we study sequences, series, power series and uniform convergence in the $\mathcal{A}$-Calculus. Here $\mathcal{A}$ denotes an associative unital real algebra. We say a function is $\mathcal{A}$-differentiable if it is real…

Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…

It has long been known that the existence of certain superquantum nonlocal correlations would cause communication complexity to collapse. The absurdity of a world in which any nonlocal binary function could be evaluated with a constant…

Fine-grained quantum supremacy is a study of proving (nearly) tight time lower bounds for classical simulations of quantum computing under "fine-grained complexity" assumptions. We show that under conjectures on Orthogonal Vectors (OV),…

We revisit the celebrated Hellmann-Feynman theorem (HFT) in the PT invariant non-Hermitian quantum physics framework. We derive a modified version of HFT by changing the definition of inner product and explicitly show that it holds good for…

While there has been progress in establishing the unprovability of complexity statements in lower fragments of bounded arithmetic, understanding the limits of Je\v{r}\'abek's theory $APC_1$ (2007) and of higher levels of Buss's hierarchy…

We study the logical content of several maximality principles related to the finite intersection principle ($F\IP$) in set theory. Classically, these are all equivalent to the axiom of choice, but in the context of reverse mathematics their…