Sciweavers

21 search results - page 1 / 5
» On the Intrinsic Complexity of Learning Recursive Functions
Sort
View
COLT
1999
Springer
13 years 8 months ago
On the Intrinsic Complexity of Learning Recursive Functions
Efim B. Kinber, Christophe Papazian, Carl H. Smith...
ALT
2003
Springer
14 years 1 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles
EUROCOLT
1995
Springer
13 years 8 months ago
The structure of intrinsic complexity of learning
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
Sanjay Jain, Arun Sharma
ALT
2001
Springer
14 years 1 months ago
Learning Recursive Functions Refutably
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas...
TCS
2008
13 years 4 months ago
Learning recursive functions: A survey
Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold's (1967) model of learning in th...
Thomas Zeugmann, Sandra Zilles