Translator Disclaimer
December 2013 Anomalous Vacillatory Learning
Achilles A. Beros
J. Symbolic Logic 78(4): 1183-1188 (December 2013). DOI: 10.2178/jsl.7804090

Abstract

In 1986, Osherson, Stob and Weinstein asked whether two variants of anomalous vacillatory learning, TxtFex$^*_*$ and TxtFext$^*_*$, could be distinguished [3]. In both, a machine is permitted to vacillate between a finite number of hypotheses and to make a finite number of errors. TxtFext$^*_*$-learning requires that hypotheses output infinitely often must describe the same finite variant of the correct set, while TxtFex$^*_*$-learning permits the learner to vacillate between finitely many different finite variants of the correct set. In this paper we show that TxtFex$^*_*$ $\neq$ TxtFext$^*_*$, thereby answering the question posed by Osherson, et al. We prove this in a strong way by exhibiting a family in TxtFex$^*_2 \setminus \mbox{TxtFext}^*_*$.

Citation

Download Citation

Achilles A. Beros. "Anomalous Vacillatory Learning." J. Symbolic Logic 78 (4) 1183 - 1188, December 2013. https://doi.org/10.2178/jsl.7804090

Information

Published: December 2013
First available in Project Euclid: 5 January 2014

zbMATH: 1290.68061
MathSciNet: MR3156518
Digital Object Identifier: 10.2178/jsl.7804090

Rights: Copyright © 2013 Association for Symbolic Logic

JOURNAL ARTICLE
6 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.78 • No. 4 • December 2013
Back to Top