Skip to main content
Conference ProceedingsOPEN ACCESS

On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2020) 12098 LNCS 124-136
DOI: 10.1007/978-3-030-51466-2_11
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The present paper surveys some results from the inductive inference of recursive functions, which are related to the characterization of inferrible function classes in terms of complexity theory, and in terms of recursive numberings. Some new results and open problems are also included.

Cite

CITATION STYLE

APA

Zeugmann, T. (2020). On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12098 LNCS, pp. 124–136). Springer. https://doi.org/10.1007/978-3-030-51466-2_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free