This paper pursues a thorough-going instrumentalist, or means-ends, approach to the theory
of inductive inference. I consider three epistemic aims: convergence to a correct theory, fast …

The approach of ordinal mind change complexity, introduced by Freivalds and Smith, uses
(notations for) constructive ordinals to bound the number of mind changes made by a …

Angluin introduced the class of pattern languages as term languages over strings on a finite
alphabet, and showed that the class is identifiable in the limit from texts (positive data). III …

The elementary formal system (EFS) is a kind of logic programs which directly manipulates
strings, and the learnability of the subclass called hereditary EFSs (HEFSs) has been …

The approach of ordinal mind change complexity, introduced by Freivalds and Smith, uses
constructive ordinals to bound the number of mind changes made by a learning machine …

Speed of convergence in Gold's identification in the limit model can be measured by
deriving bounds on the number of mind changes made by a learner before the onset of …

This paper shows that the mind change complexity of inferring from positive data the class of
unbounded unions of languages of regular patterns with constant segment length bound is …

In this paper, we reconsider the definition of procrastinating learning machines. In the
original definition of Freivalds and Smith [FS93], constructive ordinals are used to bound …

Many connections have been established between learning and logic, or learning and
topology, or logic and topology. Still, the connections are not at the heart of these fields …

We present efficient on-line algorithms for learning unions of a constant number of tree
patterns, unions of a constant number of one-variable pattern languages, and unions of a …