English
Related papers

Related papers: Acceptable Complexity Measures of Theorems

200 papers

In this paper we prove Chaitin's ``heuristic principle'', {\it the theorems of a finitely-specified theory cannot be significantly more complex than the theory itself}, for an appropriate measure of complexity. We show that the measure is…

Logic · Mathematics 2007-05-23 Cristian S. Calude , Helmut Juergensen

The famous G\"odel incompleteness theorem says that for every sufficiently rich formal theory (containing formal arithmetic in some natural sense) there exist true unprovable statements. Such statements would be natural candidates for being…

Logic · Mathematics 2011-10-18 Alexander Shen

Different from the view that information is objective reality, this paper adopts the idea that all information needs to be compiled by the interpreter before it can be observed. From the traditional complexity definition, this paper defines…

Logic in Computer Science · Computer Science 2025-02-18 Zhifeng Ma , Tianyi Wu , Zhangang Han

The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…

The existence of incompatible measurements, epitomized by Heisenberg's uncertainty principle, is one of the distinctive features of quantum theory. So far, quantum incompatibility has been studied for measurements that test the preparation…

Quantum Physics · Physics 2017-03-16 Michal Sedlak , Daniel Reitzner , Giulio Chiribella , Mario Ziman

G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…

Logic · Mathematics 2026-03-11 Alexander V. Gheorghiu

G\"odel's first and second incompleteness theorems are corner stones of modern mathematics. In this article we present a new proof of these theorems for ZFC and theories containing ZFC, using Chaitin's incompleteness theorem and a very…

Logic · Mathematics 2023-02-20 David O. Zisselman

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…

General Mathematics · Mathematics 2016-02-11 Giuseppe Raguní

In 1927 Heisenberg discovered that the ``more precisely the position is determined, the less precisely the momentum is known in this instant, and vice versa''. Four years later G\"odel showed that a finitely specified, consistent formal…

Quantum Physics · Physics 2007-05-23 C. S. Calude , M. A. Stay

In this paper we briefly review and analyze three published proofs of Chaitin's theorem, the celebrated information-theoretic version of G\"odel's incompleteness theorem. Then, we discuss our main perplexity concerning a key step common to…

History and Overview · Mathematics 2016-09-07 Germano D'Abramo

G\"odel proved in the 1930s in his famous Incompleteness Theorems that not all statements in mathematics can be proven or disproven from the accepted ZFC axioms. A few years later he showed the celebrated result that Cantor's Continuum…

Logic · Mathematics 2024-12-13 Sandra Müller , Grigor Sargsyan

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…

Logic · Mathematics 2019-07-02 Saeed Salehi , Payam Seraji

Some Goedel centenary reflections on whether incompleteness is really serious, and whether mathematics should be done somewhat differently, based on using algorithmic complexity measured in bits of information. [Enriques lecture given…

History and Overview · Mathematics 2007-05-23 G. J. Chaitin

An earlier introduced characterization of nonuniform learnability that allows the sample size to depend on the hypothesis to which the learner is compared has been redefined using the measure theoretic approach. Where nonuniform…

Machine Learning · Computer Science 2020-11-03 Ankit Bandyopadhyay

A rather easy yet rigorous proof of a version of G\"odel's first incompleteness theorem is presented. The version is "each recursively enumerable theory of natural numbers with 0, 1, +, *, =, logical and, logical not, and the universal…

Logic in Computer Science · Computer Science 2014-05-23 Antti Valmari

The 20th century has revealed two important limitations of scientific knowledge. On the one hand, the combination of Poincar\'e's nonlinear dynamics and Heisenberg's uncertainty principle leads to a world picture where physical reality is,…

History and Philosophy of Physics · Physics 2013-04-10 Fernando Sols

The existence of incompatible measurements is a fundamental phenomenon having no explanation in classical physics. Intuitively, one considers given measurements to be incompatible within a framework of a physical theory, if their…

Quantum Physics · Physics 2015-08-27 Teiko Heinosaari , Jukka Kiukas , Daniel Reitzner

Hilbert and Ackermann asked for a method to consistently extend incomplete theories to complete theories. G\"odel essentially proved that any theory capable of encoding its own statements and their proofs contains statements that are true…

Artificial Intelligence · Computer Science 2023-10-31 Dusko Pavlovic , Temra Pavlovic

Measurement incompatibility is one of the basic aspects of quantum theory. Here we study the structure of the set of compatible -- i.e. jointly measurable -- measurements. We are interested in whether or not there exist compatible…

Quantum Physics · Physics 2020-07-01 Paul Skrzypczyk , Matty J. Hoban , Ana Belén Sainz , Noah Linden

As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…

Data Structures and Algorithms · Computer Science 2020-11-25 Roman Galay , Daniil Kalistratov
‹ Prev 1 2 3 10 Next ›