On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings

DOI10.1007/978-3-030-51466-2_11OpenAlexW3037865580MaRDI QIDQ2106597

Thomas Zeugmann

Publication date: 16 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_11

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• One-sided error probabilistic inductive inference and reliable frequency identification
• Learning recursive functions: A survey
• Consistent and coherent learning with \(\delta \)-delay
• Classical recursion theory. The theory of functions and sets of natural numbers
• Some natural properties of strong-identification in inductive inference
• Learning classes of approximations to non-recursive functions.
• On learning of functions refutably.
• How inductive inference strategies discover their errors
• ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS
• Toward a mathematical theory of inductive inference
• Inductive inference of automata, functions and programs
• Ignoring data may be the only way to learn efficiently
• Classes of computable functions defined by bounds on computation
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Limiting recursion
• Some decidability results on grammatical inference and complexity
• On Effectively Computable Operators
• Language identification in the limit

This page was built for publication: On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings