Learning classes of approximations to non-recursive functions. (Q1853518): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformations that preserve learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive inference of formal languages from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a mathematical theory of inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust learning aided by context / 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: Inductive inference of recursive functions: Qualitative theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust separations in 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: Q3750102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Effectively Computable Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust behaviorally correct learning. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust learning is rich / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3041172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3722485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-sided error probabilistic inductive inference and reliable frequency identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in the theory of inductive inference by GDR mathematicians - A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Erfüllung gewisser Erhaltungssätze durch Kompliziertheitsmasse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4076766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some natural properties of strong-identification in inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding coding tricks by hyperrobust learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3790671 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(01)00405-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012806533 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:44, 30 July 2024

scientific article
Language Label Description Also known as
English
Learning classes of approximations to non-recursive functions.
scientific article

    Statements

    Learning classes of approximations to non-recursive functions. (English)
    0 references
    0 references
    0 references
    21 January 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers