Results 1 
5 of
5
Asking Questions versus Verifiability
, 1992
"... this paper, # 0 , # 1 , # 2 , . . . denotes an acceptable programming system [17], also known as a Godel numbering of the partial recursive functions [15]. The function # e is said to be computed by the program e. ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
this paper, # 0 , # 1 , # 2 , . . . denotes an acceptable programming system [17], also known as a Godel numbering of the partial recursive functions [15]. The function # e is said to be computed by the program e.
A Survey of Inductive Inference with an Emphasis on Queries
 Complexity, Logic, and Recursion Theory, number 187 in Lecture notes in Pure and Applied Mathematics Series
, 1997
"... this paper M 0 ; M 1 ; : : : is a standard list of all Turing machines, M ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
this paper M 0 ; M 1 ; : : : is a standard list of all Turing machines, M
Parsimony Hierarchies for Inductive Inference
 JOURNAL OF SYMBOLIC LOGIC
, 2004
"... 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 parsi ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
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 limcomputable 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 "notsonearly" minimal size, e.g., to be within a limcomputable 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 limcomputable 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 limcomputability, the power of the resultant learning criteria form finely graded, infinitely ramifying, infinite hierarchies intermediate between the computable and the limcomputable cases. Some of these hierarchies, for the natural notations determining them, are shown to be optimally tight.
Learning via Finitely Many Queries
"... This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the parameters of interest are the number of queries used and the expressive power of L. We study how the learning power varies ..."
Abstract
 Add to MetaCart
This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the parameters of interest are the number of queries used and the expressive power of L. We study how the learning power varies with these parameters. Preliminary results suggest that this model can help studying query inference in an resource bounded environment.
Abstract
"... Alice and Bob want to know if two strings of length n are almost equal. That is, do they differ on at most a bits? Let 0 ≤ a ≤ n − 1. We show that any deterministic protocol, as well as any errorfree quantum protocol (C ∗ version), for this problem requires at least n − 2 bits of communication. We ..."
Abstract
 Add to MetaCart
Alice and Bob want to know if two strings of length n are almost equal. That is, do they differ on at most a bits? Let 0 ≤ a ≤ n − 1. We show that any deterministic protocol, as well as any errorfree quantum protocol (C ∗ version), for this problem requires at least n − 2 bits of communication. We show the same bounds for the problem of determining if two strings differ in exactly a bits. We also prove a lower bound of n/2 − 1 for errorfree Q ∗ quantum protocols. Our results are obtained by lowerbounding the ranks of the appropriate matrices. 1