APA-Zitierstil (7. Ausg.)

Stephan, F., & Zeugmann, T. (1999). On the uniform learnability of approximations to non-recursive functions. Algorithmic Learning Theory. https://doi.org/10.1007/3-540-46769-6_23

Chicago-Zitierstil (17. Ausg.)

Stephan, Frank, und Thomas Zeugmann. "On the Uniform Learnability of Approximations to Non-recursive Functions." Algorithmic Learning Theory 1999. https://doi.org/10.1007/3-540-46769-6_23.

MLA-Zitierstil (9. Ausg.)

Stephan, Frank, und Thomas Zeugmann. "On the Uniform Learnability of Approximations to Non-recursive Functions." Algorithmic Learning Theory, 1999, https://doi.org/10.1007/3-540-46769-6_23.