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 ...
Comparing various concepts of function prediction. Part 1.
(Latvia State University, 1974)
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 ...
On computation in the limit by non-deterministic Turing machines
(Latvia State University, 1974)
Computational complexity of prediction strategies
(Latvia State University, 1977)
The value f(m+1) is predicted from given f(1), ..., f(m). For every enumeration T(n, x) there is a strategy that predicts the n-th function of T making no more than log2(n) errors (Barzdins-Freivalds). It is proved in the ...