( en | de | ru )

 

Disambiguation of "Kinber, Efim B."

Author of the publication

copydeleteadd this publication to your clipboard
Degrees of Inferability.

, , , , , , , and . COLT, page 180-192. ACM, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Efim Profis

Efim Sadigorsky

Elena Efimova

Svetlana Efimenko

Efim Silberkweit

 

Other publications of authors with the same name

Probabilistic versus Deterministic Memory Limited Learning., , and . GOSLER Final Report, volume 961 of Lecture Notes in Computer Science, page 155-161. Springer, (1995)Learning recursive functions from approximations., , , and . EuroCOLT, volume 904 of Lecture Notes in Computer Science, page 140-153. Springer, (1995)Automatic learning from positive data and negative counterexamples., , and . Inf. Comput., (2017)On the Power of Probabilistic Inductive Inference in Nonstandard Numberings., , and . Elektronische Informationsverarbeitung und Kybernetik, 25 (5/6): 239-243 (1989)Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations., , and . COLT, page 47-58. Morgan Kaufmann, (2000)On Separation of the Emptiness and Equivalence Problems for Program Schemes., and . Inf. Process. Lett., 20 (2): 91-93 (1985)One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples., and . ALT, volume 4754 of Lecture Notes in Computer Science, page 257-271. Springer, (2007)On the Power of Inductive Inference from Good Examples., , and . Theor. Comput. Sci., 110 (1): 131-144 (1993)The Inclusion Problem for some Classes of Deterministic Multitape Automata.. Theor. Comput. Sci., (1983)Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations., , and . J. Comput. Syst. Sci., 63 (3): 305-354 (2001)