Invertible classes
From MaRDI portal
The paper studies the problem of invertibility of recursive operators which map \({\mathcal F}\) to \({\mathcal F}\), where \({\mathcal F}\) is a class of functions. Four increasingly stronger types of invertibility are introduced and it is shown that they are different. The paper also studies the related issue of whether an enumeration of operators contains every function in a class \({\mathcal F}\), i.e., whether the enumeration covers \({\mathcal F}\). Three types of coverings are introduced and investigated.
Recommendations
Cites work
- Classical recursion theory. The theory of functions and sets of natural numbers
- Classical recursion theory. The theory of functions and sets of natural numbers.
- Comparison of identification criteria for machine inductive inference
- Generalized cohesiveness
- How complicated is the set of stable models of a recursive logic program?
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1498335 (Why is no real title available?)
- scientific article; zbMATH DE number 3420728 (Why is no real title available?)
- Language identification in the limit
- Note on arithmetic models for consistent formulae of the predicate calculus
This page was built for publication: Invertible classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2382282)
