scientific article; zbMATH DE number 3655912

MaRDI QIDQ3855155zbMATH OpenFDO

Authors Rūsiņš Freivalds

Publication date 1979

zbMATH Keywords

finite identifiabilitygeneral recursive functionsGödel numberinginductive inferenceprobabilistic Turing machine processing graphs of total functions

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Cited in

(16)

• Probability and plurality for aggregations of learning machines
• On the power of inductive inference from good examples
• Probabilistic language learning under monotonicity constraints
• The synthesis of language learners.
• The power of probabilism in Popperian FINite learning
• Probabilistic and pluralistic learners with mind changes
• Probabilistic inductive inference: A survey
• Aspects of complexity of probabilistic learning under monotonicity constraints
• Simulating teams with many conjectures
• On the power of probabilistic strategies in inductive inference
• On the inference of approximate programs
• 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

This page was built for publication:

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