Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • Anomalous Vacillatory Learning

  • Achilles A. Beros
  • Journal:
    The Journal of Symbolic Logic / Volume 78 / Issue 4 / December 2013
    Published online by Cambridge University Press:
    12 March 2014, pp. 1183-1188
    Print publication:
    December 2013

  • 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** ≠ TxtFext**, thereby answering the question posed by Osherson, et al. We prove this in a strong way by exhibiting a family in TxtFex*2 TxtFext**.