Learning recursive functions: A survey (Q924164)

From MaRDI portal

Revision as of 08:15, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Learning recursive functions: A survey (English)

0 references

Thomas Zeugmann

0 references

0 references

Theoretical Computer Science

0 references

publication date

28 May 2008

0 references

zbMATH Keywords

inductive inference

0 references

recursive functions

0 references

recursion theory

0 references

complexity theory

0 references

computable numberings

0 references

algorithmic learning

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2008.02.021

0 references

Inductive inference and unsolvability

0 references

Consistent and coherent learning with \(\delta \)-delay

0 references

Probabilistic inductive inference: A survey

0 references

Transformations that preserve learnability

0 references

0 references

0 references

Closedness properties in ex-identification

0 references

0 references

Inductive inference of automata, functions and programs

0 references

0 references

Toward a mathematical theory of inductive inference

0 references

A Machine-Independent Theory of the Complexity of Recursive Functions

0 references

On the necessity of Occam algorithms

0 references

Computational Complexity and the Existence of Complexity Gaps

0 references

The position of index sets of identifiable sets in the arithmetical hierarchy

0 references

Asking questions to minimize errors

0 references

Incremental concept learning for bounded data mining.

0 references

Robust learning aided by context

0 references

Robust learning -- rich and poor

0 references

Comparison of identification criteria for machine inductive inference

0 references

Tradeoffs in the inductive inference of nearly minimal size programs

0 references

The Operator Gap

0 references

On the error correcting power of pluralism in BC-type inductive inference

0 references

0 references

Some decidability results on grammatical inference and complexity

0 references

0 references

Inductive inference of recursive functions: Complexity bounds

0 references

Identifying nearly minimal Gödel numbers from additional information

0 references

On the intrinsic complexity of learning

0 references

Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings

0 references

On the power of inductive inference from good examples

0 references

Trade-off among parameters affecting inductive inference

0 references

0 references

Saving the phenomena: Requirements that inductive inference machines not contradict known data

0 references

0 references

0 references

0 references

Limiting recursion

0 references

Language identification in the limit

0 references

Learning binary relations using weighted majority voting

0 references

0 references

Reflective inductive inference of recursive functions

0 references

Equivalence of models for polynomial learnability

0 references

On Effectively Computable Operators

0 references

Robust behaviorally correct learning.

0 references

On the intrinsic complexity of learning recursive functions

0 references

Learning with the knowledge of an upper bound on program size

0 references

Robust learning is rich

0 references

0 references

0 references

One-sided error probabilistic inductive inference and reliable frequency identification

0 references

0 references

Research in the theory of inductive inference by GDR mathematicians - A survey

0 references

0 references

Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings

0 references

On the role of search for learning from examples

0 references

Recursive Properties of Abstract Complexity Classes

0 references

Incremental learning from positive data

0 references

Learning indexed families of recursive languages from positive data: A survey

0 references

0 references

The weighted majority algorithm

0 references

Classes of computable functions defined by bounds on computation

0 references

Some natural properties of strong-identification in inductive inference

0 references

0 references

0 references

Classical recursion theory. Vol. II

0 references

Avoiding coding tricks by hyperrobust learning

0 references

Probabilistic inductive inference

0 references

0 references

0 references

The Power of Pluralism for Automatic Program Synthesis

0 references

0 references

0 references

0 references

Theory of Formal Systems. (AM-47)

0 references

A formal theory of inductive inference. Part I

0 references

A formal theory of inductive inference. Part II

0 references

Learning classes of approximations to non-recursive functions.

0 references

0 references

0 references

0 references

0 references

0 references

0 references

On the power of probabilistic strategies in inductive inference

0 references

0 references

Ignoring data may be the only way to learn efficiently

0 references

Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems

0 references

0 references

ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS

0 references

0 references

0 references

0 references

Separation of uniform learning classes.

0 references

An approach to intrinsic complexity of uniform learning

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.TCS.2008.02.021

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:924164

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q924164&oldid=38534187"