Inductive inference and unsolvability

DOI10.2307/2275058MaRDI QIDQ3985087zbMATH OpenOpenAlexFDO

Authors Leonard M. Adleman, Manuel Blum

Publication date 27 June 1992

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2275058

zbMATH Keywords

halting probleminductive inferencerecursive function

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30) Applications of computability and recursion theory (03D80)

Recommendations

• The position of index sets of identifiable sets in the arithmetical hierarchy
• A Mechanical Proof of the Unsolvability of the Halting Problem
• scientific article; zbMATH DE number 3932417
• Algorithmic complexity as a criterion of unsolvability
• scientific article; zbMATH DE number 996380

Cited in

(27)

• Learning via queries and oracles
• Extremes in the degrees of inferability
• Structural measures for games and process control in the branch learning model
• Computability theory. Abstracts from the workshop held January 7--13, 2018
• Two problems of direct inference
• Equivalences between learning of data and probability distributions, and their applications
• The complexity of universal text-learners.
• Refuting learning revisited.
• Classical, quantum and biological randomness as relative unpredictability
• Algorithmic complexity as a criterion of unsolvability
• A general comparison of language learning from examples and from queries
• On the amount of nonconstructivity in learning recursive functions
• Inductive inference and reverse mathematics
• Enlarging learnable classes
• SYSTEM FUNCTIONS AND THEIR DECISION PROBLEMS
• Unscrambling the quantum omelette
• On the classification of computable languages
• The complexity of universal text-learners
• Indirect inference with(out) constraints
• Robust learning with infinite additional information
• Learning algebraic structures from text
• On the classification of recursive languages
• Unprincipled
• On the non-existence of maximal inference degrees for language identification
• Input-dependence in function-learning
• On the learnability of vector spaces
• Learning recursive functions: A survey

This page was built for publication: Inductive inference and unsolvability

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