Learnability of Enumerable Classes of Recursive Functions from "Typical" Examples

Nessel. "Learnability of Enumerable Classes of Recursive Functions from "Typical" Examples." International Conference on Algorithmic Learning Theory, 1999. doi:10.1007/3-540-46769-6_22

[Nessel. "Learnability of Enumerable Classes of Recursive Functions from "Typical" Examples." International Conference on Algorithmic Learning Theory, 1999.](https://mlanthology.org/alt/1999/nessel1999alt-learnability/) doi:10.1007/3-540-46769-6_22

@inproceedings{nessel1999alt-learnability,
  title     = {{Learnability of Enumerable Classes of Recursive Functions from "Typical" Examples}},
  author    = {Nessel, Jochen},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {1999},
  pages     = {264-275},
  doi       = {10.1007/3-540-46769-6_22},
  url       = {https://mlanthology.org/alt/1999/nessel1999alt-learnability/}
}