Closedness Properties in EX-Identification of Recursive Functions
Abstract
In this paper we investigate in which cases unions of identifiable classes of recursive functions are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identification types still have features resembling closedness. For each of them we find such n that 1) if every union of n - 1 classes out of U _1,., U _n is identifiable, so is the union of all n classes; 2) there are such classes U _1, … U _n − 1 that every union of n - 2 classes out of them is identifiable, while the union of - 1 classes is not. We show that by finding these n we can distinguish which requirements put on the identifiability of unions of classes are satisfiable and which are not. We also show how our problem is connected with team learning.
Cite
Text
Apsitis et al. "Closedness Properties in EX-Identification of Recursive Functions." International Conference on Algorithmic Learning Theory, 1998. doi:10.1007/3-540-49730-7_4Markdown
[Apsitis et al. "Closedness Properties in EX-Identification of Recursive Functions." International Conference on Algorithmic Learning Theory, 1998.](https://mlanthology.org/alt/1998/apsitis1998alt-closedness/) doi:10.1007/3-540-49730-7_4BibTeX
@inproceedings{apsitis1998alt-closedness,
title = {{Closedness Properties in EX-Identification of Recursive Functions}},
author = {Apsitis, Kalvis and Freivalds, Rusins and Simanovskis, Raimonds and Smotrovs, Juris},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {1998},
pages = {46-60},
doi = {10.1007/3-540-49730-7_4},
url = {https://mlanthology.org/alt/1998/apsitis1998alt-closedness/}
}