Search
Now showing items 1-4 of 4
Comparing various concepts of function prediction. Part 2.
(Latvia State University, 1975)
Prediction: f(m+1) is guessed from given f(0), ..., f(m). Program synthesis: a program computing f is guessed from given f(0), ..., f(m). The hypotheses are required to be correct for all sufficiently large m, or with some ...
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 ...
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. ...
Comparing various types of limiting synthesis and prediction of functions
(Latvia State University, 1974)