Browsing Publicēti raksti (MII) / Published Articles by Subject "probabilistic"
Now showing items 1-2 of 2
-
Inductive inference of recursive functions: complexity bounds
(Springer Verlag, 1991)This survey includes principal results on complexity of inductive inference for recursively enumerable classes of total recursive functions. Inductive inference is a process to find an algorithm from sample computations. ... -
Prediction of the next value of a function
(1981)The following model of inductive inference is considered. Arbitrary set tau = {tau_1, tau_2, ..., tau_n} of n total functions N->N is fixed. A "black box" outputs the values f(0), f(1), ..., f(m), ... of some function f ...