[PDF][PDF] A formal definition of intelligence based on an intensional variant of algorithmic complexity
J Hernández-Orallo… - … of Engineering of …, 1998 - researchgate.net
To face up a formal definition of intelligence may seem preposterous in the current
complexity of the sciences which such a definition might influence. Also, there is now a …
complexity of the sciences which such a definition might influence. Also, there is now a …
A random sampling technique for training support vector machines: For primal-form maximal-margin classifiers
Random sampling techniques have been developed for combinatorial optimization
problems. In this note, we report an application of one of these techniques for training …
problems. In this note, we report an application of one of these techniques for training …
Learning recursive functions: A survey
T Zeugmann, S Zilles - Theoretical Computer Science, 2008 - Elsevier
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 the limit, many …
for at least four decades. Starting with Gold's (1967) model of learning in the limit, many …
Mind change efficient learning
W Luo, O Schulte - Information and Computation, 2006 - Elsevier
This paper studies efficient learning with respect to mind changes. Our starting point is the
idea that a learner that is efficient with respect to mind changes minimizes mind changes not …
idea that a learner that is efficient with respect to mind changes minimizes mind changes not …
On the intrinsic complexity of language identification
S Jain, A Sharma - Proceedings of the seventh annual conference on …, 1994 - dl.acm.org
A new investigation of the complexity of language identification is undertaken using the
notion of reduction from recursion theory and complexity theory. The approach, referred to …
notion of reduction from recursion theory and complexity theory. The approach, referred to …
Elementary formal systems, intrinsic complexity, and procrastination
S Jain, A Sharma - Proceedings of the ninth annual conference on …, 1996 - dl.acm.org
Recently, rich subclasses of elementary formal systems(EFS) have been shown to be
identifiable in the limit from only positive data. Examples of these classes are Angluin's …
identifiable in the limit from only positive data. Examples of these classes are Angluin's …
An optimal parallel algorithm for learning DFA
Sequential algorithms given by Alguin (1987) and Schapire (1992) learn deterministic finite
automata (dfa) exactly from Membership and Equivalence queries. These algorithms are …
automata (dfa) exactly from Membership and Equivalence queries. These algorithms are …
The structure of intrinsic complexity of learning
S Jain, A Sharma - The Journal of Symbolic Logic, 1997 - cambridge.org
Limiting identification of re indexes for re languages (from a presentation of elements of the
language) and limiting identification of programs for computable functions (from a graph of …
language) and limiting identification of programs for computable functions (from a graph of …
Language learning from texts: Degrees of intrinsic complexity and their characterizations
S Jain, E Kinber, R Wiehagen - Journal of Computer and System Sciences, 2001 - Elsevier
This paper deals with two problems:(1) what makes languages learnable in the limit by
natural strategies of varying hardness, and (2) what makes classes of languages the hardest …
natural strategies of varying hardness, and (2) what makes classes of languages the hardest …
Iterative learning of simple external contextual languages
It is investigated for which choice of a parameter q, denoting the number of contexts, the
class of simple external contextual languages is iteratively learnable. On the one hand, the …
class of simple external contextual languages is iteratively learnable. On the one hand, the …