Affiliations: Computer Science Division, University of California, Berkeley, CA 94720-1776 USA. e-mail: [email protected] | Institute of Mathematics and Computer Science, University of Latvia, Raina bulv. 29, LV-1459 Riga, Latvia. e-mail: [email protected] | Department of Computer Science, University of Maryland, College Park, MD 20742 USA. e-mail: [email protected]
Note: [] Address for correspondence: Computer Science Division, University of California, Berkeley, CA 94720-1776 USA
Note: [] Address for correspondence: Institute of Mathematics and Computer Science, University of Latvia, Raina bulv. 29, LV-1459 Riga, Latvia
Note: [] Address for correspondence: Department of Computer Science, University of Maryland, College Park, MD 20742 USA
Abstract: 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 mindchanges. We investigate possibility of using arbitrary linearly ordered sets to bound mindchanges in similar way. It turns out that using certain ordered sets it is possible to define inductive inference types different from the previously known ones. We investigate properties of the new inductive inference types and compare them to other types.
