Article,

Falsifiable implies Learnable

.
(2014)cite arxiv:1408.6618.

Abstract

The paper demonstrates that falsifiability is fundamental to learning. We prove the following theorem for statistical learning and sequential prediction: If a theory is falsifiable then it is learnable -- i.e. admits a strategy that predicts optimally. An analogous result is shown for universal induction.

Tags

Users

  • @kirk86
  • @dblp

Comments and Reviews