Freivalds et al. "Co-Learnability and FIN-Identifiability of Enumerable Classes of Total Recursive Functions." International Conference on Algorithmic Learning Theory, 1994. doi:10.1007/3-540-58520-6_57
Markdown
[Freivalds et al. "Co-Learnability and FIN-Identifiability of Enumerable Classes of Total Recursive Functions." International Conference on Algorithmic Learning Theory, 1994.](https://mlanthology.org/alt/1994/freivalds1994alt-colearnability/) doi:10.1007/3-540-58520-6_57
BibTeX
@inproceedings{freivalds1994alt-colearnability,
title = {{Co-Learnability and FIN-Identifiability of Enumerable Classes of Total Recursive Functions}},
author = {Freivalds, Rusins and Gobleja, Dace and Karpinski, Marek and Smith, Carl H.},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {1994},
pages = {100-105},
doi = {10.1007/3-540-58520-6_57},
url = {https://mlanthology.org/alt/1994/freivalds1994alt-colearnability/}
}