Sciweavers

ICML
1996
IEEE
15 years 1 months ago
On the Learnability of the Uncomputable
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
Richard H. Lathrop