Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference

Ambainis and Smotrovs. "Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference." International Conference on Algorithmic Learning Theory, 1994. doi:10.1007/3-540-58520-6_50

[Ambainis and Smotrovs. "Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference." International Conference on Algorithmic Learning Theory, 1994.](https://mlanthology.org/alt/1994/ambainis1994alt-enumerable/) doi:10.1007/3-540-58520-6_50

@inproceedings{ambainis1994alt-enumerable,
  title     = {{Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference}},
  author    = {Ambainis, Andris and Smotrovs, Juris},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {1994},
  pages     = {10-25},
  doi       = {10.1007/3-540-58520-6_50},
  url       = {https://mlanthology.org/alt/1994/ambainis1994alt-enumerable/}
}