@inproceedings{354bfd87713f4d5294ce9c74dde9d939,
title = "General inductive inference types based on linearly-ordered sets",
abstract = "In this paper, we reconsider the definitions of procrastinating learning machines. In the original definition of Freivalds and Smith [FS93], constructive ordinals are used to bound mindchanges. We investigate the possibility of using arbitrary linearly ordered sets to bound mindchanges in a similar way. It turns out that using certain ordered sets it is possible to define inductive inference types more general than the previously known ones. We investigate properties of the new inductive inference types and compare them to other types.",
author = "Andris Ambainis and Rūsiņ{\v s} Freivalds and Smith, \{Carl H.\}",
note = "Publisher Copyright: {\textcopyright} 1996, Springer Verlag. All rights reserved.; 13th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1996 ; Conference date: 22-02-1996 Through 24-02-1996",
year = "1996",
doi = "10.1007/3-540-60922-9\_21",
language = "English",
isbn = "9783540609223",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "243--253",
editor = "Claude Puech and Rudiger Reischuk",
booktitle = "STACS 1996 - 13th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings",
address = "Germany",
}