Inductive inference and unsolvability
From MaRDI portal
Publication:3985087
DOI10.2307/2275058zbMath0751.03018OpenAlexW2020133060MaRDI QIDQ3985087
Leonard M. Adleman, Manuel Blum
Publication date: 27 June 1992
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275058
Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10)
Related Items
Refuting learning revisited. ⋮ On the classification of computable languages ⋮ The complexity of universal text-learners ⋮ Algorithmic complexity as a criterion of unsolvability ⋮ Inductive inference and reverse mathematics ⋮ On the learnability of vector spaces ⋮ Enlarging learnable classes ⋮ On the classification of recursive languages ⋮ Learning recursive functions: A survey ⋮ Unscrambling the quantum omelette ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ A general comparison of language learning from examples and from queries ⋮ On the Amount of Nonconstructivity in Learning Recursive Functions ⋮ On the non-existence of maximal inference degrees for language identification ⋮ Robust learning with infinite additional information ⋮ Equivalences between learning of data and probability distributions, and their applications ⋮ Learning algebraic structures from text ⋮ Input-dependence in function-learning ⋮ Classical, quantum and biological randomness as relative unpredictability ⋮ Structural measures for games and process control in the branch learning model ⋮ Learning via queries and oracles ⋮ The complexity of universal text-learners. ⋮ Extremes in the degrees of inferability
