Extending Chaitin's Incompleteness Theorem
Computational Complexity
2023-06-06 v3
Abstract
Chaitin's incompleteness theorem states that sufficiently rich formal systems cannot prove lower bounds on Kolmogorov complexity. In this paper we extend this theorem by showing theories that prove the Kolmogorov complexity of a large (but finite) number of strings are inaccessible. This is done by first showing such theories have large information with the halting sequence. Then, by applying the independence postulate, such theories are shown to be inaccessible in the physical world.
Keywords
Cite
@article{arxiv.2001.10919,
title = {Extending Chaitin's Incompleteness Theorem},
author = {Samuel Epstein},
journal= {arXiv preprint arXiv:2001.10919},
year = {2023}
}