Results 1  10
of
32
Gems In The Field Of Bounded Queries
"... Let A be a set. Given {x1 , . . . , xn}, I may want to know (1) which elements of {x1 , . . . , xn} are in A, (2) how many elements of {x1 , . . . , xn} are in A, or (3) is {x1 , . . . , xn}#A  even. All of these can be determined with n queries to A. For which A,n can we get by with fe ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Let A be a set. Given {x1 , . . . , xn}, I may want to know (1) which elements of {x1 , . . . , xn} are in A, (2) how many elements of {x1 , . . . , xn} are in A, or (3) is {x1 , . . . , xn}#A  even. All of these can be determined with n queries to A. For which A,n can we get
Frequency Computation and Bounded Queries
 Theoretical Computer Science
, 1995
"... There have been several papers over the last ten years that consider the number of queries needed to compute a function as a measure of its complexity. The following function has been studied extensively in that light: F A a (x 1 ; : : : ; x a ) = A(x 1 ) 1 1 1 A(x a ): We are interested in t ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
in the complexity (in terms of the number of queries) of approximating F A a . Let b a and let f be any function such that F A a (x 1 ; : : : ; x a ) and f(x 1 ; : : : ; x a ) agree on at least b bits. For a general set A we have matching upper and lower bounds that depend on coding theory
On the Query Complexity of Sets
, 1996
"... . There has been much research over the last eleven years that considers the number of queries needed to compute a function as a measure of its complexity. We are interested in the complexity of certain sets in this context. We study the sets ODD A n = f(x1 ; : : : ; xn) : jA " fx1 ; : : : ; ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
; : : : ; xn gj is oddg and WMOD(m) A n = f(x1 ; : : : ; xn) : jA " fx1 ; : : : ; xn gj 6j 0 (mod m)g. If A = K or A is semirecursive, we obtain tight bounds on the query complexity of ODD A n and WMOD(m) A n . We obtain lower bounds for A r.e. The lower bounds for A r.e. are derived from the lower
Inferring answers to queries
, 2007
"... One focus of inductive inference is to infer a program for a function f from observations or queries about f. We propose a new line of research which examines the question of inferring the answers to queries. For a given class of computable functions, we consider the learning (in the limit) of prope ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
One focus of inductive inference is to infer a program for a function f from observations or queries about f. We propose a new line of research which examines the question of inferring the answers to queries. For a given class of computable functions, we consider the learning (in the limit
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 (1 self)
 Add to MetaCart
this paper M 0 ; M 1 ; : : : is a standard list of all Turing machines, M
Cryptography by Yves Nievergelt. Review by Saif Terai. This book is in two parts: Theory and Applications. The Theory is Logic, the applications are cryptography. 2. Rippling: MetaLevel Guidance For Mathematical Reasoning by Alan Bundy, David
"... Basin, Dieter Hutter, and Andrew Ireland. Review by Maulik Dave. The book is about Rippling, which is a proof planning technique. Automatic theorem proving is done by rewrite rules. The conjecture, assumptions, and already proved theorems are supplied to an automatic theorem prover in the form of re ..."
Abstract
 Add to MetaCart
Basin, Dieter Hutter, and Andrew Ireland. Review by Maulik Dave. The book is about Rippling, which is a proof planning technique. Automatic theorem proving is done by rewrite rules. The conjecture, assumptions, and already proved theorems are supplied to an automatic theorem prover in the form
Computability Theory and Applications (CTA) draft535
"... NOTICE: This material has been copyrighted and may not be reproduced or distributed without the written consent of the author. This book in under contract with SpringerVerlag. ..."
Abstract
 Add to MetaCart
NOTICE: This material has been copyrighted and may not be reproduced or distributed without the written consent of the author. This book in under contract with SpringerVerlag.
On a Quantitative Notion of Uniformity
 In Mathematical Foundations of Computer Science, volume 969 of LNCS
, 1995
"... . One topic arising in recent research on "Bounded Query Classes" is to consider quantitative aspects of recursion theory, and in particular various notions of parameterized recursive approximations of sets. An important question is, for which values of the parameters  depending on th ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
. One topic arising in recent research on "Bounded Query Classes" is to consider quantitative aspects of recursion theory, and in particular various notions of parameterized recursive approximations of sets. An important question is, for which values of the parameters  depending
Universität Heidelberg
"... 1 For a fixed set A, the number of queries to A needed in order to decide a set S is a measure of S’s complexity. We consider the complexity of certain sets defined in terms of A: ODD A n = {(x1,..., xn) : # A n (x1,..., xn) is odd} and, for m ≥ 2, MODm A n = {(x1,..., xn) : # A n (x1,..., xn) � ≡ ..."
Abstract
 Add to MetaCart
1 For a fixed set A, the number of queries to A needed in order to decide a set S is a measure of S’s complexity. We consider the complexity of certain sets defined in terms of A: ODD A n = {(x1,..., xn) : # A n (x1,..., xn) is odd} and, for m ≥ 2, MODm A n = {(x1,..., xn) : # A n (x1,..., xn
Results 1  10
of
32