Unprovability Comes to Machine Learning

Unprovability Comes to Machine Learning
Charles Sykes/AP Images for Siemens

During the twentieth century, discoveries in mathematical logic revolutionized our understanding of the very foundations of mathematics. In 1931, the logician Kurt Gödel showed that, in any system of axioms that is expressive enough to model arithmetic, some true statements will be unprovable1.

Read Full Article »
Comment
Show comments Hide Comments

Related Articles