Question on Chaitin

Recently I'v studied the meta mathematical theory of Gregory Chaitin.
There's one thing that I do not understand properly.

Does Chaitin claim that a theorem T is unprovable from an axiom set A iff
complexity(T) > complexity(A)

Complexity of a structure (such as a theorem of axiom set) is the measure of
the smallest computer program that generates the structure.

Thanks for your feedback!

David Costa


.

Loading