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

DOI10.1016/S0019-9958(86)80034-1zbMath0605.03017MaRDI QIDQ3743310

Ulrike Brandt

Publication date: 1986

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

zbMATH Keywords

halting problemoracleinductive inference machineindex sets of identifiable sets of partial recursive functions

Mathematics Subject Classification ID

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

Related Items (5)

Algorithmic complexity as a criterion of unsolvability ⋮ Index sets and presentations of complexity classes ⋮ Learning recursive functions: A survey ⋮ Aspects of complexity of probabilistic learning under monotonicity constraints ⋮ Classifying the Arithmetical Complexity of Teaching Models

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