Why sometimes probabilistic algorithms can be more effective
Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Frequency computation and bounded queries
Theoretical Computer Science
Learning recursive functions from approximations
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Time bounded frequency computations
Information and Computation
Lower Space Bounds for Randomized Computation
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Models of Computation, Riemann Hypothesis, and Classical Mathematics
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Unions of Identifiable Classes of Total Recursive Functions
AII '92 Proceedings of the International Workshop on Analogical and Inductive Inference
Complexity of Probabilistic Versus Deterministic Automata
Baltic Computer Science, Selected Papers
Inductive Inference of Recursive Functions: Qualitative Theory
Baltic Computer Science, Selected Papers
Inductive Inference of Recursive Functions: Complexity Bounds
Baltic Computer Science, Selected Papers
Regular frequency computations
Theoretical Computer Science - Insightful theory
Finite automata and their decision problems
IBM Journal of Research and Development
Amount of nonconstructivity in deterministic finite automata
Theoretical Computer Science
| Hi-index | 0.00 |
Prediction of functions is one of processes considered in inductive inference. There is a "black box" with a given total function f in it. The result of the inductive inference machine F() is expected to be f(n+1). Deterministic and probabilistic prediction of functions has been widely studied. Frequency computation is a mechanism used to combine features of deterministic and probabilistic algorithms. Frequency computation has been used for several types of inductive inference, especially, for learning via queries. We study frequency prediction of functions and show that that there exists an interesting hierarchy of predictable classes of functions.