Abstract

In this paper we discuss the effects of errors in input data on recursion theoretic learning. We consider three types of inaccuracy in input data depending on the presence of extra data (noise), missing data (incompleteness) or both (imperfection). We show that for function learning incompleteness harms strictly more than noise. However for language learning, identification from incomplete text and identification from noisy text are incomparable. We also prove hierarchies based on the number of inaccuracies present in the input.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.