6533b831fe1ef96bd1298e5b
RESEARCH PRODUCT
On the inductive inference of recursive real-valued functions
Carl SmithSetsuo ArikawaRūsiņš FreivaldsEiju HirowatariKalvis Apsĩissubject
Complex-valued functionGeneral Computer ScienceReal analysisLearning theoryComputable numberInductive inference0102 computer and information sciences02 engineering and technology01 natural sciencesμ-recursive functionComputable analysisTheoretical Computer ScienceAlgebraμ operatorComputable functionReal-valued computationReal-valued function010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingAlgorithmComputer Science(all)Mathematicsdescription
AbstractWe combine traditional studies of inductive inference and classical continuous mathematics to produce a study of learning real-valued functions. We consider two possible ways to model the learning by example of functions with domain and range the real numbers. The first approach considers functions as represented by computable analytic functions. The second considers arbitrary computable functions of recursive real numbers. In each case we find natural examples of learnable classes of functions and unlearnable classes of functions.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1999-05-01 | Theoretical Computer Science |