On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
From MaRDI portal
Publication:2106597
Recommendations
Cites work
- scientific article; zbMATH DE number 3861134 (Why is no real title available?)
- scientific article; zbMATH DE number 3986615 (Why is no real title available?)
- scientific article; zbMATH DE number 3536063 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3404166 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Classes of computable functions defined by bounds on computation
- Classical recursion theory. The theory of functions and sets of natural numbers
- Comparison of identification criteria for machine inductive inference
- Consistent and coherent learning with \(\delta \)-delay
- How inductive inference strategies discover their errors
- Ignoring data may be the only way to learn efficiently
- Inductive inference of automata, functions and programs
- Language identification in the limit
- Learning classes of approximations to non-recursive functions.
- Learning recursive functions: A survey
- Limiting recursion
- ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS
- On Effectively Computable Operators
- On learning of functions refutably.
- One-sided error probabilistic inductive inference and reliable frequency identification
- Some decidability results on grammatical inference and complexity
- Some natural properties of strong-identification in inductive inference
- Toward a mathematical theory of inductive inference
This page was built for publication: On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106597)
