Reflective inductive inference of recursive functions

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we investigate reflective inductive inference of recursive functions. A reflective IIM is a learning machine that is additionally able to assess its own competence. First, we formalize reflective learning from arbitrary, and from canonical, example sequences. Here, we arrive at four different types of reflection: reflection in the limit, optimistic, pessimistic and exact reflection. Then, we compare the learning power of reflective IIMs with each other as well as with the one of standard IIMs for learning in the limit, for consistent learning of three different types, and for finite learning. © 2008 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Grieser, G. (2008). Reflective inductive inference of recursive functions. Theoretical Computer Science, 397(1–3), 57–69. https://doi.org/10.1016/j.tcs.2008.02.022

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