相关论文: Incompleteness, Complexity, Randomness and Beyond

We give a new proof for Godel's second incompleteness theorem, based on Kolmogorov complexity, Chaitin's incompleteness theorem, and an argument that resembles the surprise examination paradox. We then go the other way around and suggest…

This is an article written in a popular science style, in which I will explain: (1) the famous Heisenberg uncertainty principle, expressing the experimental incompatibility of certain properties of micro-physical entities; (2) the Compton…

The generalized uncertainty principle discloses a self-complete characteristic of gravity, namely the possibility of masking any curvature singularity behind an event horizon as a result of matter compression at the Planck scale. In this…

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…

The uncertainty principle lies at the heart of quantum physics, and is widely thought of as a fundamental limit on the measurement precisions of incompatible observables. Here we show that the traditional uncertainty relation in fact…

Little effort has been devoted to studying generalised notions or models of (un)predictability, yet is an important concept throughout physics and plays a central role in quantum information theory, where key results rely on the supposed…

To explore the limitation of a class of quantum algorithms originally proposed for the Hilbert's tenth problem, we consider two further classes of mathematically non-decidable problems, those of a modified version of the Hilbert's tenth…

The overarching goal of this thesis is to demonstrate that complementarity is at the heart of quantum information theory, that it allows us to make (some) sense of just what information "quantum information" refers to, and that it is useful…

The mathematical notion of incompleteness (eg of rational numbers, Turing-computable functions, and arithmetic proof) does not play a key role in conventional physics. Here, a reformulation of the kinematics of quantum theory is attempted,…

This is the transcript of a lecture given at UMass-Lowell in which I compare and contrast the work of Godel and of Turing and my own work on incompleteness. I also discuss randomness in physics vs randomness in pure mathematics.

The Einstein-Podolsky-Rosen argument on quantum mechanics incompleteness is formulated in terms of elements of reality inferred from joint (as opposed to alternative) measurements, in two examples involving entangled states of three…

Randomness is a key feature of quantum physics. Heisenberg's uncertainty principle reveals the existence of an intrinsic noise, usually explored through Gaussian squeezed states. Due to their insufficiency for quantum advantage, the focus…

Analogous to G\"odel's incompleteness theorems is a theorem in physics to the effect that the set of explanations of given evidence is uncountably infinite. An implication of this theorem is that contact between theory and experiment…

In [Found. Phys. 48.12 (2018): 1669], the notion of 'epistemic horizon' was introduced as an explanation for many of the puzzling features of quantum mechanics. There, it was shown that Lawvere's theorem, which forms the categorical…

An ultimate universal theory -- a complete theory that accounts, via few and simple first principles, for all the phenomena already observed and that will ever be observed -- has been, and still is, the aspiration of most physicists and…

Uncertainty principle is one of the cornerstones of quantum theory. In the literature, there are two types of uncertainty relations, the operator form concerning the variances of physical observables and the entropy form related to entropic…

Since Renes et al. [J. Math. Phys. 45, 2171 (2004)], there has been much effort in the quantum information community to prove (or disprove) the existence of symmetric informationally complete (SIC) sets of quantum states in arbitrary finite…

Godel's First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a couple of syntactic-semantic notions, one is the consistency of a theory with the set of all true…

Although the categorical arithmetic is not effectively axiomatizable, the belief that the incompleteness Theorems can be apply to it is fairly common. Furthermore, the so-called "essential" (or "inherent") semantic incompleteness of the…

A formalisation of G\"odel's incompleteness theorems using the Isabelle proof assistant is described. This is apparently the first mechanical verification of the second incompleteness theorem. The work closely follows {\'S}wierczkowski…