1 citations · 1 across the 20 of their papers we have counts for
1 paper · 2 filters
Samuel Epstein
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 th…