Learning classes of approximations to non-recursive functions.

DOI10.1016/S0304-3975(01)00405-4MaRDI QIDQ1853518zbMATH OpenOpenAlexFDO

Authors Frank Stephan, Thomas Zeugmann

Publication date 21 January 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(01)00405-4

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1453045
• On the intrinsic complexity of learning recursive functions
• scientific article; zbMATH DE number 1804101
• Robust learning -- rich and poor
• A learning-theoretic characterization of classes of recursive functions

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Avoiding coding tricks by hyperrobust learning
• Classical recursion theory. Vol. II
• Comparison of identification criteria for machine inductive inference
• scientific article; zbMATH DE number 3833940 (Why is no real title available?)
• scientific article; zbMATH DE number 3861134 (Why is no real title available?)
• scientific article; zbMATH DE number 3952736 (Why is no real title available?)
• scientific article; zbMATH DE number 3986615 (Why is no real title available?)
• scientific article; zbMATH DE number 4055080 (Why is no real title available?)
• scientific article; zbMATH DE number 3681743 (Why is no real title available?)
• scientific article; zbMATH DE number 67627 (Why is no real title available?)
• scientific article; zbMATH DE number 3493874 (Why is no real title available?)
• scientific article; zbMATH DE number 517033 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3404166 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Inductive inference of recursive functions: qualitative theory
• Language identification in the limit
• On Effectively Computable Operators
• ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS
• One-sided error probabilistic inductive inference and reliable frequency identification
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Robust behaviorally correct learning.
• Robust learning aided by context
• Robust learning is rich
• Robust separations in inductive inference
• Some natural properties of strong-identification in inductive inference
• Toward a mathematical theory of inductive inference
• Transformations that preserve learnability
• Über die Erfüllung gewisser Erhaltungssätze durch Kompliziertheitsmasse

Cited in

(9)

• Learning recursive functions from approximations
• Robust behaviorally correct learning.
• On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
• Enlarging learnable classes
• scientific article; zbMATH DE number 1500663 (Why is no real title available?)
• scientific article; zbMATH DE number 1453045 (Why is no real title available?)
• Learnable Algorithm on the Continuum
• Learning recursive functions: A survey
• Consistent and coherent learning with \(\delta \)-delay

This page was built for publication: Learning classes of approximations to non-recursive functions.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853518)