On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
type: Item
instance of: scholarly article
title: On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
DOI: 10.1007/978-3-030-51466-2_11
author: Thomas Zeugmann
publication date: 2022-12-16T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7633502
MaRDI profile type: Publication
full work available at URL: 978-3-030-51466-2 11
OpenAlex ID: W3037865580
cites work: Consistent and coherent learning with \(\delta \)-delay
cites work: Q5670562
cites work: Inductive inference of automata, functions and programs
cites work: Toward a mathematical theory of inductive inference
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: Comparison of identification criteria for machine inductive inference
cites work: Some decidability results on grammatical inference and complexity
cites work: How inductive inference strategies discover their errors
cites work: Limiting recursion
cites work: Language identification in the limit
cites work: Q3750102
cites work: On Effectively Computable Operators
cites work: On learning of functions refutably.
cites work: One-sided error probabilistic inductive inference and reliable frequency identification
cites work: Classes of computable functions defined by bounds on computation
cites work: Some natural properties of strong-identification in inductive inference
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: Q5573961
cites work: Learning classes of approximations to non-recursive functions.
cites work: Q4111545
cites work: Ignoring data may be the only way to learn efficiently
cites work: Q3329450
cites work: ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS
cites work: Learning recursive functions: A survey
description: scientific article; zbMATH DE number 7633502