rapaport@sunybcs (William J. Rapaport) (02/09/88)
STATE UNIVERSITY OF NEW YORK AT BUFFALO
DEPARTMENT OF COMPUTER SCIENCE
COLLOQUIUM
THE POWER OF VACILLATION
John Case
Department of Computer Science
State University of New York at Buffalo
Recursion theory provides a relatively abstract,
elegant account of the absolute boundaries of computability
by discrete machines. The insights it can provide are best
described as philosophical. In this talk I examine a sub-
part of this theory pertaining to machine learning, specifi-
cally, in this case, language learning.
I will describe Gold's influential, recursion
theoretic, language-learning paradigm (and variations on the
theme), point out its easily seen, considerable weaknesses,
but then argue, by means of example theorems, that it is
possible, nonetheless, to obtain some insights into language
learning within the general context of this paradigm.
For example, I will squeeze some insight out of a
theorem to the effect that allowing a kind of vacillation in
the convergent behavior of algorithmic, language-learning
devices leads, perhaps unexpectedly, to greater learning
power.
I'll sketch the proofs of a couple of the theorems, in
part to convince you they are true, but mostly because the
proofs are beautiful and illustrative of techniques in the
area.
Date: Thursday, 11th February, 1988
Time: 3:30 pm to 4:30 pm
Place: Bell 337, Amherst Campus
Wine and Cheese will be served at 4:30 pm at Bell 224.
For further information, call (716) 636-3199.