Browsing B6 – LU institūti un aģentūras / Institutes and agencies of the UL by Subject "complexity bounds"
Now showing items 1-1 of 1
-
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. ...