With time-bound or policy-trajectory observations, the class of general recursive functions becomes learnable in the limit, and Turing-machine trajectory learning reduces to finite-state transducer inference.
A note on the entscheidungsproblem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Learning Algorithms in the Limit
With time-bound or policy-trajectory observations, the class of general recursive functions becomes learnable in the limit, and Turing-machine trajectory learning reduces to finite-state transducer inference.