On the Uniform Learnability of Approximations to Non-Recursive Functions

Cite

Text

Stephan and Zeugmann. "On the Uniform Learnability of Approximations to Non-Recursive Functions." International Conference on Algorithmic Learning Theory, 1999. doi:10.1007/3-540-46769-6_23

Markdown

[Stephan and Zeugmann. "On the Uniform Learnability of Approximations to Non-Recursive Functions." International Conference on Algorithmic Learning Theory, 1999.](https://mlanthology.org/alt/1999/stephan1999alt-uniform/) doi:10.1007/3-540-46769-6_23

BibTeX

@inproceedings{stephan1999alt-uniform,
  title     = {{On the Uniform Learnability of Approximations to Non-Recursive Functions}},
  author    = {Stephan, Frank and Zeugmann, Thomas},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {1999},
  pages     = {276-290},
  doi       = {10.1007/3-540-46769-6_23},
  url       = {https://mlanthology.org/alt/1999/stephan1999alt-uniform/}
}