You are not currently logged in.
Access JSTOR through your library or other institution:
Function Identification from Noisy Data with Recursive Error Bounds
Vol. 45, No. 1 (Jul., 1996), pp. 91-102
Published by: Springer
Stable URL: http://www.jstor.org/stable/20012709
Page Count: 12
You can always find the topics here!Topics: Mathematical functions, Recursive functions, Natural numbers, Inference, Error bounds, Learning theory, Computer software, Experimental results, Sufficient conditions, Ordered pairs
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
New success criteria of inductive inference in computational learning theory are introduced which model learning total (not necessarily recursive) functions with (possibly everywhere) imprecise theories from (possibly always) inaccurate data. It is proved that for any level of error allowable by the new success criteria, there exists a class ϑ of recursive functions such that not all f ∈ ϑ are identifiable via the criterion at that level of error. Also, necessary and sufficient conditions on the error level are given for when more classes of functions may be identified.
Erkenntnis (1975-) © 1996 Springer