Search
Now showing items 1-2 of 2
On computation in the limit by non-deterministic Turing machines
(Latvia State University, 1974)
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. ...