On the impact of forgetting on learning machines
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On the impact of forgetting on learning machines
Journal of the ACM (JACM)
Probabilistic and team PFIN-type learning: general properties
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Elementary formal systems, intrinsic complexity, and procrastination
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Generalized notions of mind change complexity
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
On a generalized notion of mistake bounds
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
On the intrinsic complexity of learning recursive functions
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Learning algebraic structures from text
Theoretical Computer Science - Algorithmic learning theory
Mind change complexity of learning logic programs
Theoretical Computer Science
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Mind Change Complexity of Learning Logic Programs
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Learning Algebraic Structures from Text Using Semantical Knowledge
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learning by Switching Type of Information
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Classes with Easily Learnable Subclasses
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Learning, Logic, and Topology in a Common Framework
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
On the intrinsic complexity of learning recursive functions
Information and Computation
Learning by switching type of information
Information and Computation
Counting extensional differences in BC-learning
Information and Computation
Generalized notions of mind change complexity
Information and Computation
Classes with easily learnable subclasses
Information and Computation
Uncomputability: the problem of induction internalized
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
On the classification of recursive languages
Information and Computation
Unifying logic, topology and learning in parametric logic
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Mind change efficient learning
Information and Computation
On ordinal VC-dimension and some notions of complexity
Theoretical Computer Science - Algorithmic learning theory
On the data consumption benefits of accepting increased uncertainty
Theoretical Computer Science
Ockham's razor, empirical complexity, and truth-finding efficiency
Theoretical Computer Science
Non-U-shaped vacillatory and team learning
Journal of Computer and System Sciences
Probabilistic and team PFIN-type learning: General properties
Journal of Computer and System Sciences
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Feasible Iteration of Feasible Learning Functionals
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Topological Properties of Concept Spaces
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Dynamically Delayed Postdictive Completeness and Consistency in Learning
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Mind change efficient learning
Information and Computation
Theoretical Computer Science
Topological properties of concept spaces (full version)
Information and Computation
COLT'07 Proceedings of the 20th annual conference on Learning theory
Iterative learning of simple external contextual languages
Theoretical Computer Science
Incremental learning with ordinal bounded example memory
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
The complexity of learning SUBSEQ (A)
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Mind change complexity of inferring unbounded unions of pattern languages from positive data
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Mind change efficient learning
COLT'05 Proceedings of the 18th annual conference on Learning Theory
On a syntactic characterization of classification with a mind change bound
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Compute inclusion depth of a pattern
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Learning with ordinal-bounded memory from positive data
Journal of Computer and System Sciences
Inductive Inference with Procrastination: Back to Definitions
Fundamenta Informaticae
Hi-index | 0.01 |