3 ms·
Inconsistent systems cannot prove Kolmogorov complexity limits. What's your point?
by yters 9y ago
Inconsistent systems cannot prove Kolmogorov complexity limits. What's your point?
- red75prime 9y agoInconsistent axiomatic systems can prove anything. Thus either Haskell programs can prove the limits (and prove the opposite statement, as they are inconsistent) or they aren't axiomatic system as you mean it. Both possibilities contradict your statement: > Chaitin's incompleteness theorem mean AI cannot learn
- yters 9y agoIf programs are not axiomatic systems, then they cannot learn, period. Only ones that have consistent axioms have a hope of learning, and even then it is severely limited.
- yters 9y agoInconsistent axioms can provide a valid proof of Kolmogorov complexity, but not a sound one. Thinking a false statement is true is not learning.