Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T17:09:36.240Z Has data issue: false hasContentIssue false

Parsimony hierarchies for inductive inference

Published online by Cambridge University Press:  12 March 2014

Andris Ambainis
Affiliation:
Institute of Mathematics and Computer Science, University of Latvia, Raina Bulv. 29, Riga, LV-1459, Latvia, E-mail: ambainis@lanet.lv
John Case
Affiliation:
Department of Computer and Information Sciences, University of Delaware, Newark, de 19716, USA, E-mail: case@cis.udel.edu
Sanjay Jain
Affiliation:
School of Computing, National University of Singapore, Singapore 119260, Republic of Singapore, E-mail: sanjay@comp.nus.edu.sg
Mandayam Suraj
Affiliation:
Department of Computer and Information Sciences, University of Delaware, Newark, de 19716, USA, E-mail: suraj@cis.udel.edu

Abstract

Freivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and “nearly” minimal size. i.e.. within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is considered highly desirable. A lim-computable function is (by definition) one calculable by a total procedure allowed to change its mind finitely many times about its output. Investigated is the possibility of assuaging somewhat the limitation on learning power resulting from requiring parsimonious final programs by use of criteria which require the final, correct programs to be “not-so-nearly” minimal size, e.g., to be within a lim-computable function of actual minimal size. It is shown that some parsimony in the final program is thereby retained, yet learning power strictly increases. Considered, then, are lim-computable functions as above but for which notations for constructive ordinals are used to bound the number of mind changes allowed regarding the output. This is a variant of an idea introduced by Freivalds and Smith. For this ordinal notation complexity bounded version of lim-computability, the power of the resultant learning criteria form finely graded, infinitely ramifying, infinite hierarchies intermediate between the computable and the lim-computable cases. Some of these hierarchies, for the natural notations determining them, are shown to be optimally tight.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable