Kinber, E. B.
Overview
Works:  5 works in 5 publications in 2 languages and 14 library holdings 

Classifications:  QA76.M3, 005.1 
Publication Timeline
.
Most widely held works by
E. B Kinber
Teoreticheskie voprosy programmirovanii︠a︡ : sbornik nauchnykh trudov(
Book
)
1 edition published in 1988 in Russian and held by 4 WorldCat member libraries worldwide
1 edition published in 1988 in Russian and held by 4 WorldCat member libraries worldwide
Frequency computation and bounded queries by
Richard Beigel(
Book
)
1 edition published in 1993 in English and held by 4 WorldCat member libraries worldwide
Abstract: "For a set A and a number m let F[superscript A, subscript n](x₁ ..., x[subscript n]) = [subscript XA](x₁) ... [subscript XA](x[subscript n]). We study how hard it is to approximate this function in terms of the number of queries required. We obtain matching upper and lower bounds for the case A = K (the halting set), A semirecursive, and (assuming P [not equal] NP) A = SAT. Some of our bounds depend on functions from coding theory."
1 edition published in 1993 in English and held by 4 WorldCat member libraries worldwide
Abstract: "For a set A and a number m let F[superscript A, subscript n](x₁ ..., x[subscript n]) = [subscript XA](x₁) ... [subscript XA](x[subscript n]). We study how hard it is to approximate this function in terms of the number of queries required. We obtain matching upper and lower bounds for the case A = K (the halting set), A semirecursive, and (assuming P [not equal] NP) A = SAT. Some of our bounds depend on functions from coding theory."
On the impact of forgetting on learning machines by
R. V Freĭvald(
Book
)
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
Abstract: "People tend not to have perfect memories when it comes to learning, or to anything else for that matter. Most formal studies of learning, however, assume a perfect memory. Some approaches have restricted the number of items that could be retained. We introduce a complexity theoretic accounting of memory utilization by learning machines. In our new model, memory is measured in bits as a function of the size of the input. There is a hierarchy of learnablity [sic] based on increasing memory allotment. The lower bound results are proved using an unusual combination of pumping and mutual recursion theorem arguments. For technical reasons it was necessary consider two types of memory: long and short term
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
Abstract: "People tend not to have perfect memories when it comes to learning, or to anything else for that matter. Most formal studies of learning, however, assume a perfect memory. Some approaches have restricted the number of items that could be retained. We introduce a complexity theoretic accounting of memory utilization by learning machines. In our new model, memory is measured in bits as a function of the size of the input. There is a hierarchy of learnablity [sic] based on increasing memory allotment. The lower bound results are proved using an unusual combination of pumping and mutual recursion theorem arguments. For technical reasons it was necessary consider two types of memory: long and short term
Teoretičeskie voprosy programmirovanija : sbornik naučnych trudov(
Book
)
1 edition published in 1988 in Russian and held by 2 WorldCat member libraries worldwide
1 edition published in 1988 in Russian and held by 2 WorldCat member libraries worldwide
Probabilistic inductive inference in nonstandard numberings by
R. V Freĭvald(
Book
)
1 edition published in 1987 in English and held by 1 WorldCat member library worldwide
1 edition published in 1987 in English and held by 1 WorldCat member library worldwide
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Associated Subjects