The position of index sets of identifiable sets in the arithmetical hierarchy

DOI10.1016/S0019-9958(86)80034-1MaRDI QIDQ3743310zbMATH OpenFDO

Authors Ulrike Brandt

Publication date 1986

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(86)80034-1

zbMATH Keywords

halting problemindex sets of identifiable sets of partial recursive functionsinductive inference machineoracle

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Undecidability and degrees of sets of sentences (03D35) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Recommendations

• scientific article; zbMATH DE number 3859102
• Characterizing language identification in terms of computable numberings
• scientific article; zbMATH DE number 4118351
• Learning theory in the arithmetic hierarchy. II.
• Index sets in the arithmetical hierarchy

Cited in

(10)

• Index sets and presentations of complexity classes
• Algorithmic complexity as a criterion of unsolvability
• Classifying the arithmetical complexity of teaching models
• scientific article; zbMATH DE number 3859102 (Why is no real title available?)
• scientific article; zbMATH DE number 4055080 (Why is no real title available?)
• Inductive inference and unsolvability
• scientific article; zbMATH DE number 2077146 (Why is no real title available?)
• scientific article; zbMATH DE number 4118351 (Why is no real title available?)
• Aspects of complexity of probabilistic learning under monotonicity constraints
• Learning recursive functions: A survey

This page was built for publication: The position of index sets of identifiable sets in the arithmetical hierarchy

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