Please use this identifier to cite or link to this item:
|Title:||Program synthesis in the presence of infinite number of inaccuracies|
|Source:||Jain, S. (1996). Program synthesis in the presence of infinite number of inaccuracies. Journal of Computer and System Sciences 53 (3) : 583-591. ScholarBank@NUS Repository.|
|Abstract:||Most studies modeling inaccurate data in Gold style learning consider cases in which the number of inaccuracies is finite. The present paper argues that this approach is not reasonable for modelling inaccuracies in concepts that are infinite in nature (for example, graphs of computable functions). The effect of an infinite number of inaccuracies in the input data in Gold's model of learning is considered in the context of identification in the limit of computer programs from graphs of computable functions. Three kinds of inaccuracies, namely, noisy data, incomplete data, and imperfect data, are considered. The amount of each of these inaccuracies in the input is measured using certain density notions. A number of interesting hierarchy results are shown based on the densities of inaccuracies present in the input data. Several results establishing trade-offs between the density and type of inaccuracies are also derived. © 1996 Academic Press, Inc.|
|Source Title:||Journal of Computer and System Sciences|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 15, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.