scientific article; zbMATH DE number 3681743
From MaRDI portal
Publication:3877665
Cited in
(27)- On the power of recursive optimizers
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Aggregating inductive expertise on partial recursive functions
- Learning recursive functions from approximations
- On the intrinsic complexity of learning recursive functions
- Robust learning aided by context
- Inductive inference with additional information.
- On the information carried by programs about the objects they compute
- Learning classes of approximations to non-recursive functions.
- The complexity of universal text-learners.
- Learning to win process-control games watching game-masters
- Trees and learning
- Robust learning -- rich and poor
- Learning finite variants of single languages from informant
- On the amount of nonconstructivity in learning recursive functions
- Hypothesis Spaces for Learning
- The complexity of universal text-learners
- Hypothesis spaces for learning
- Robust learning with infinite additional information
- Costs of general purpose learning
- Closedness properties in ex-identification
- Learning all subfunctions of a function
- On the complexity of learning programs
- Characterizing language identification in terms of computable numberings
- Input-dependence in function-learning
- Training sequences
- Learning recursive functions: A survey
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3877665)
