Invertible classes (Q2382282): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.05.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4213043973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of identification criteria for machine inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized cohesiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on arithmetic models for consistent formulae of the predicate calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: How complicated is the set of stable models of a recursive logic program? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4499412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank

Latest revision as of 10:22, 27 June 2024

scientific article
Language Label Description Also known as
English
Invertible classes
scientific article

    Statements

    Invertible classes (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2007
    0 references
    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.
    0 references
    0 references
    inverse operator
    0 references
    recursive operators
    0 references
    enumeration of operators
    0 references
    0 references
    0 references