On the amount of nonconstructivity in learning recursive functions

DOI10.1007/978-3-642-20877-5_33MaRDI QIDQ3010414zbMATH OpenOpenAlexFDO

Authors Rūsiņš Freivalds, Thomas Zeugmann

Publication date 1 July 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20877-5_33

zbMATH Keywords

inductive inferencenonconstructivityrecursive functions

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Recursive functions and relations, subrecursive hierarchies (03D20) Computational learning theory (68Q32)

Recommendations

• On the amount of nonconstructivity in learning formal languages from positive data
• On the amount of nonconstructivity in learning formal languages from text
• Amount of Nonconstructivity in Finite Automata
• Amount of nonconstructivity in deterministic finite automata
• Toward the interpretation of non-constructive reasoning as non-monotonic learning

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Amount of nonconstructivity in deterministic finite automata
• Amount of Nonconstructivity in Finite Automata
• Automata that take advice
• Comparison of identification criteria for machine inductive inference
• Ein Verfahren der mathematischen Logik
• scientific article; zbMATH DE number 3427224 (Why is no real title available?)
• scientific article; zbMATH DE number 3681743 (Why is no real title available?)
• scientific article; zbMATH DE number 3515457 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3307567 (Why is no real title available?)
• Inductive inference and unsolvability
• Language identification in the limit
• Learning recursive functions: A survey
• Limiting recursion
• Minimal elements of \(\text{И}(H;p)\) and conjugacy of Levi complements in finite Chevalley groups.
• On the structure of degrees of inferability.
• Recursive Properties of Abstract Complexity Classes
• Some remarks on the theory of graphs
• Turing machines that take advice

Cited in

(8)

• Toward the interpretation of non-constructive reasoning as non-monotonic learning
• Amount of nonconstructivity in deterministic finite automata
• On the amount of nonconstructivity in learning formal languages from text
• Non-recursive trade-offs are ``almost everywhere
• On the amount of nonconstructivity in learning formal languages from positive data
• Confident and Consistent Partial Learning of Recursive Functions
• Amount of Nonconstructivity in Finite Automata
• scientific article; zbMATH DE number 7301306 (Why is no real title available?)

This page was built for publication: On the amount of nonconstructivity in learning recursive functions

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