The axiomatic power of Kolmogorov complexity |
| |
Authors: | Laurent Bienvenu Andrei Romashchenko Alexander Shen Antoine Taveneaux Stijn Vermeeren |
| |
Affiliation: | 1. Laboratoire J.-V. Poncelet, CNRS, Moscow, Russian Federation;2. LIRMM, CNRS & Université Montpellier 2, France;3. LIAFA, CNRS & Université Paris 7, France;4. University of Leeds, United Kingdom |
| |
Abstract: | The famous Gödel incompleteness theorem states that for every consistent, recursive, and 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 how can we obtain them? One classical (and well studied) approach is to add to some theory T an axiom that claims the consistency of T . In this paper we discuss another approach motivated by Chaitin's version of Gödel's theorem where axioms claiming the randomness (or incompressibility) of some strings are probabilistically added, and show that it is not really useful, in the sense that this does not help us prove new interesting theorems. This result answers a question recently asked by Lipton. The situation changes if we take into account the size of the proofs: randomly chosen axioms may help making proofs much shorter (unless NP=PSPACE). |
| |
Keywords: | primary, 03D32, 03F99, 68Q30 secondary, 03F20 |
本文献已被 ScienceDirect 等数据库收录! |
|