Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Function Identification from Noisy Data with Recursive Error Bounds

Mark Changizi
Erkenntnis (1975-)
Vol. 45, No. 1 (Jul., 1996), pp. 91-102
Published by: Springer
Stable URL: http://www.jstor.org/stable/20012709
Page Count: 12
  • Download ($43.95)
  • Cite this Item
Function Identification from Noisy Data with Recursive Error Bounds
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
[91]
    [91]
  • Thumbnail: Page 
92
    92
  • Thumbnail: Page 
93
    93
  • Thumbnail: Page 
94
    94
  • Thumbnail: Page 
95
    95
  • Thumbnail: Page 
96
    96
  • Thumbnail: Page 
97
    97
  • Thumbnail: Page 
98
    98
  • Thumbnail: Page 
99
    99
  • Thumbnail: Page 
100
    100
  • Thumbnail: Page 
101
    101
  • Thumbnail: Page 
102
    102