Learning recursive functions: A survey (Q924164): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981403153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive inference and unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistent and coherent learning with \(\delta \)-delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic inductive inference: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformations that preserve learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closedness properties in ex-identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive inference of automata, functions and programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685065 / 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: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the necessity of Occam algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity and the Existence of Complexity Gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: The position of index sets of identifiable sets in the arithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asking questions to minimize errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental concept learning for bounded data mining. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust learning aided by context / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust learning -- rich and poor / 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: Tradeoffs in the inductive inference of nearly minimal size programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Operator Gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the error correcting power of pluralism in BC-type inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decidability results on grammatical inference and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive inference of recursive functions: Complexity bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying nearly minimal Gödel numbers from additional information / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the intrinsic complexity of learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of inductive inference from good examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trade-off among parameters affecting inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3855155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving the phenomena: Requirements that inductive inference machines not contradict known data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4018074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning binary relations using weighted majority voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3750102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflective inductive inference of recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of models for polynomial learnability / 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: On the intrinsic complexity of learning recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with the knowledge of an upper bound on program size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust learning is rich / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3894947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3041172 / 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: Q3722485 / 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: Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the role of search for learning from examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Properties of Abstract Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental learning from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning indexed families of recursive languages from positive data: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted majority algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of computable functions defined by bounds on computation / 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: Q4398828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955317 / 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: Probabilistic inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Pluralism for Automatic Program Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4328063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4470554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3782751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Formal Systems. (AM-47) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning classes of approximations to non-recursive functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4935997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of probabilistic strategies in inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ignoring data may be the only way to learn efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems / 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 / cites work
 
Property / cites work: Q4282561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3148804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation of uniform learning classes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to intrinsic complexity of uniform learning / rank
 
Normal rank

Latest revision as of 09:58, 28 June 2024

scientific article
Language Label Description Also known as
English
Learning recursive functions: A survey
scientific article

    Statements

    Learning recursive functions: A survey (English)
    0 references
    0 references
    0 references
    28 May 2008
    0 references
    inductive inference
    0 references
    recursive functions
    0 references
    recursion theory
    0 references
    complexity theory
    0 references
    computable numberings
    0 references
    algorithmic learning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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