Refuting learning revisited
โ Scribed by Wolfgang Merkle; Frank Stephan
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 325 KB
- Volume
- 298
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Learning of recursive functions refutably informally means that for every recursive function, the learning machine has either to learn this function or to refute it, that is to signal that it is not able to learn it. Three modi of making precise the notion of refuting are considered. We show that th
We consider inductive language learning and machine discovery from examples with some errors. In the present paper, the error or incorrectness we consider is the one described uniformly in terms of a distance over strings. Firstly, we introduce a notion of a recursively generable distance over strin