Learning recursive functions: A survey
type: Item
instance of: scholarly article
title: Learning recursive functions: A survey
zbMATH Open document ID: 1146.68443
author: Thomas Zeugmann
author: Sandra Zilles
published in: Theoretical Computer Science
publication date: 2008-05-28T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 5279846
zbMATH Keywords: inductive inference
zbMATH Keywords: recursive functions
zbMATH Keywords: recursion theory
zbMATH Keywords: complexity theory
zbMATH Keywords: computable numberings
zbMATH Keywords: algorithmic learning
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.02.021
OpenAlex ID: W1981403153
cites work: Inductive inference and unsolvability
cites work: Consistent and coherent learning with \(\delta \)-delay
cites work: Probabilistic inductive inference: A survey
cites work: Transformations that preserve learnability
cites work: Q3993187
cites work: Q4004178
cites work: Closedness properties in ex-identification
cites work: Q5670562
cites work: Inductive inference of automata, functions and programs
cites work: Q5685065
cites work: Toward a mathematical theory of inductive inference
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: On the necessity of Occam algorithms
cites work: Computational Complexity and the Existence of Complexity Gaps
cites work: The position of index sets of identifiable sets in the arithmetical hierarchy
cites work: Asking questions to minimize errors
cites work: Incremental concept learning for bounded data mining.
cites work: Robust learning aided by context
cites work: Robust learning -- rich and poor
cites work: Comparison of identification criteria for machine inductive inference
cites work: Tradeoffs in the inductive inference of nearly minimal size programs
cites work: The Operator Gap
cites work: On the error correcting power of pluralism in BC-type inductive inference
cites work: Q3774988
cites work: Some decidability results on grammatical inference and complexity
cites work: Q3877665
cites work: Inductive inference of recursive functions: Complexity bounds
cites work: Identifying nearly minimal Gödel numbers from additional information
cites work: On the intrinsic complexity of learning
cites work: Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings
cites work: On the power of inductive inference from good examples
cites work: Trade-off among parameters affecting inductive inference
cites work: Q3855155
cites work: Saving the phenomena: Requirements that inductive inference machines not contradict known data
cites work: Q3999206
cites work: Q4348129
cites work: Q4018074
cites work: Limiting recursion
cites work: Language identification in the limit
cites work: Learning binary relations using weighted majority voting
cites work: Q3750102
cites work: Reflective inductive inference of recursive functions
cites work: Equivalence of models for polynomial learnability
cites work: On Effectively Computable Operators
cites work: Robust behaviorally correct learning.
cites work: On the intrinsic complexity of learning recursive functions
cites work: Learning with the knowledge of an upper bound on program size
cites work: Robust learning is rich
cites work: Q3894947
cites work: Q3041172
cites work: One-sided error probabilistic inductive inference and reliable frequency identification
cites work: Q3722485
cites work: Research in the theory of inductive inference by GDR mathematicians - A survey
cites work: Q4013547
cites work: Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
cites work: On the role of search for learning from examples
cites work: Recursive Properties of Abstract Complexity Classes
cites work: Incremental learning from positive data
cites work: Learning indexed families of recursive languages from positive data: A survey
cites work: Q4013745
cites work: The weighted majority algorithm

Learning recursive functions: A survey (cites work)
cites work: Classes of computable functions defined by bounds on computation

Learning recursive functions: A survey (cites work)
cites work: Some natural properties of strong-identification in inductive inference

Learning recursive functions: A survey (cites work)
cites work: Q4398828

Learning recursive functions: A survey (cites work)
cites work: Q4955317

Learning recursive functions: A survey (cites work)
cites work: Classical recursion theory. Vol. II

Learning recursive functions: A survey (cites work)
cites work: Avoiding coding tricks by hyperrobust learning

Learning recursive functions: A survey (cites work)
cites work: Probabilistic inductive inference

Learning recursive functions: A survey (cites work)
cites work: Q4068662

Learning recursive functions: A survey (cites work)
cites work: Q5573961

Learning recursive functions: A survey (cites work)
cites work: The Power of Pluralism for Automatic Program Synthesis

Learning recursive functions: A survey (cites work)
cites work: Q4328063

Learning recursive functions: A survey (cites work)
cites work: Q4470554

Learning recursive functions: A survey (cites work)
cites work: Q3782751

Learning recursive functions: A survey (cites work)
cites work: Theory of Formal Systems. (AM-47)

Learning recursive functions: A survey (cites work)
cites work: A formal theory of inductive inference. Part I

Learning recursive functions: A survey (cites work)
cites work: A formal theory of inductive inference. Part II

Learning recursive functions: A survey (cites work)
cites work: Learning classes of approximations to non-recursive functions.

Learning recursive functions: A survey (cites work)
cites work: Q5672194

Learning recursive functions: A survey (cites work)
cites work: Q3214824

Learning recursive functions: A survey (cites work)
cites work: Q4935997

Learning recursive functions: A survey (cites work)
cites work: Q4115138

Learning recursive functions: A survey (cites work)
cites work: Q4170707

Learning recursive functions: A survey (cites work)
cites work: Q4282560

Learning recursive functions: A survey (cites work)
cites work: On the power of probabilistic strategies in inductive inference

Learning recursive functions: A survey (cites work)
cites work: Q4111545

Learning recursive functions: A survey (cites work)
cites work: Ignoring data may be the only way to learn efficiently

Learning recursive functions: A survey (cites work)
cites work: Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems

Learning recursive functions: A survey (cites work)
cites work: Q3329450

Learning recursive functions: A survey (cites work)
cites work: ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS

Learning recursive functions: A survey (cites work)
cites work: Q3790671

Learning recursive functions: A survey (cites work)
cites work: Q4282561

Learning recursive functions: A survey (cites work)
cites work: Q3148804

Learning recursive functions: A survey (cites work)
cites work: Separation of uniform learning classes.

Learning recursive functions: A survey (cites work)
cites work: An approach to intrinsic complexity of uniform learning

Learning recursive functions: A survey (DOI)
DOI: 10.1016/J.TCS.2008.02.021