On the intrinsic complexity of learning recursive functions
type: Item
instance of: scholarly article
title: On the intrinsic complexity of learning recursive functions
zbMATH Open document ID: 1028.68120
DOI: 10.1016/S0890-5401(03)00059-2
author: Sanjay Jain
author: Christophe Papazian
author: Rolf Wiehagen
author: Efim Kinber
author: Carl H. Smith
published in: Information and Computation
publication date: 2003-07-29T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1956114
zbMATH Keywords: learning classes of objects
zbMATH Keywords: reducibility
MaRDI profile type: Publication
cites work: Ordinal mind change complexity of language identification
cites work: On the classification of computable languages
cites work: Comparison of identification criteria for machine inductive inference
cites work: On the complexity of inductive inference
cites work: Inductive inference of recursive functions: Complexity bounds
cites work: Inductive inference of recursive functions: Qualitative theory
cites work: On the intrinsic complexity of learning
cites work: On the role of procrastination in machine learning
cites work: Q3877665
cites work: Q4198056
cites work: Recursion theoretic models of learning: Some results and intuitions
cites work: Language identification in the limit
cites work: Q3041172
cites work: The intrinsic complexity of language identification
cites work: The structure of intrinsic complexity of learning
cites work: Elementary formal systems, intrinsic complexity, and procrastination
cites work: A learning-theoretic characterization of classes of recursive functions
cites work: Research in the theory of inductive inference by GDR mathematicians - A survey
cites work: Q4153600
cites work: Prediction-preserving reducibility
cites work: Gödel numberings of partial recursive functions
cites work: Q5573961
cites work: Q4328063
cites work: On one-sided versus two-sided classification
description: scientific article; zbMATH DE number 1956114