scientific article
From MaRDI portal
Publication:3855155
zbMath0422.03012MaRDI QIDQ3855155
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
inductive inferenceGödel numberingfinite identifiabilitygeneral recursive functionsprobabilistic Turing machine processing graphs of total functions
Related Items (16)
Probability and plurality for aggregations of learning machines ⋮ The power of probabilism in Popperian FINite learning ⋮ Probabilistic and pluralistic learners with mind changes ⋮ Probabilistic language learning under monotonicity constraints ⋮ Simulating teams with many conjectures ⋮ Learning recursive functions: A survey ⋮ Quantum inductive inference by finite automata ⋮ Absolute versus probabilistic classification in a logical setting ⋮ Probabilistic and team PFIN-type learning: General properties ⋮ Taming teams with mind changes ⋮ On the power of inductive inference from good examples ⋮ Probabilistic inductive inference: A survey ⋮ Aspects of complexity of probabilistic learning under monotonicity constraints ⋮ On the power of probabilistic strategies in inductive inference ⋮ The synthesis of language learners. ⋮ On the inference of approximate programs
This page was built for publication:
