Now showing items 1-4 of 4
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. ...
On speeding up synthesis and prediction of functions
(Latvia State University, 1974)
Modeling and Query Language for Hospitals