Related papers: Investigating the computable Friedman-Stanley jump
Quantum correlations are central to the foundations of quantum physics and form the basis of quantum technologies. Here, our goal is to connect quantum correlations and computation: using quantum correlations as a resource for computation -…
Recently, Chamseddine and Mukhanov introduced a higher-derivative scalar-tensor theory which leads to a modified Friedmann equation allowing for bouncing solutions. As we note in the present work, this Friedmann equation turns out to…
A class of (possibly) degenerate integro-differential equations of parabolic type is considered, which includes the Kolmogorov equations for jump diffusions. Existence and uniqueness of the solutions are established in Bessel potential…
Motivated by Williams' problem of measuring novel differences between shift equivalence (SE) and strong shift equivalence (SSE), we introduce three equivalence relations that provide new ways to obstruct SSE while merely assuming SE. Our…
The hidden-variable question is whether or not various properties --- randomness or correlation, for example --- that are observed in the outcomes of an experiment can be explained via introduction of extra (hidden) variables which are…
Frank and Lieb gave a new, rearrangement-free, proof of the sharp Hardy-Littlewood-Sobolev inequalities by exploiting their conformal covariance. Using this they gave new proofs of sharp Sobolev inequalities for the embeddings…
We present an interesting connection between Einstein-Friedmann equations for the models of universe filled with scalar field and the special form of Abel equation of the first kind. This connection works in both ways: first, we show how,…
This book aims to provide a brief overview of recent advancements in the theory of inverse problems for stochastic partial differential equations. In order to keep the content concise, we will only discuss the inverse problems of two…
The recently initiated approach called computability logic is a formal theory of interactive computation. See a comprehensive online source on the subject at http://www.cis.upenn.edu/~giorgi/cl.html . The present paper contains a soundness…
We firstly show that due to their resplendency ordered henselian valued fields admit relative field quantifier elimination in the Denef--Pas language expanded by linear orders in the field and residue field sort. Secondly, we deduce from a…
We introduce a notion of relative primeness for equivalence relations, strengthening the notion of non-reducibility, and show for many standard benchmark equivalence relations that non-reducibility may be strengthened to relative primeness.…
Shapley values, originating in game theory and increasingly prominent in explainable AI, have been proposed to assess the contribution of facts in query answering over databases, along with other similar power indices such as Banzhaf…
Some elementary rigorous remark about the replica formalism in the Statistical Physics' approach to threshold phenomena in Computational Complexity Theory is presented.
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,…
This paper follows up on a recent pre-print (Durham [2005]) by first deriving a set theoretic relationship between the generalized uncertainty relations and the Clauser-Horne inequalities. The physical, metaphysical, and metamathematical…
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…
The capacity of quantum computation exceeds that of classical computers. A revolutionary step in computation is driven by quantumness or quantum correlations, which are permanent in entanglements but often in separable states; therefore,…
A theory of Clebsch-Gordan coefficients for $SL(2, C)$ is given using only rational numbers. Features include orthogonality relations, recurrence relations, and Regge's symmetry group. Results follow from elementary representation theory…
We show that Frenkel's integral representation of the quantum relative entropy provides a natural framework to derive continuity bounds for quantum information measures. Our main general result is a dimension-independent semi-continuity…
The quantum relative entropy is frequently used as a distance measure between two quantum states, and inequalities relating it to other distance measures are important mathematical tools in many areas of quantum information theory. We have…