Paper recorded by Signals 4 on 2026-11-01 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-11-01 on arXiv · recorded by Signals 4 on 2026-11-03
Category: cs.LG · 机器学习 · first seen 2026-11-03
We propose a new definition of machine learning, according to which a machine learns a function when it computes the function successfully, that is, when the value it returns for each input has a proper derivation in a formal system. We extend Gödel's Representability Theorem, which equates computation with derivation, to empirical targets in two ways: the theorem is extended to the computable rea