On the power of probabilistic strategies in inductive inference

DOI10.1016/0304-3975(83)90067-1MaRDI QIDQ760795zbMATH OpenOpenAlexFDO

Authors Rolf Wiehagen, Efim Kinber, Rūsiņš Freivalds

Publication date 1984

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(83)90067-1

zbMATH Keywords

Turing machineprobabilistic algorithmsrecursive functionsinductive inference of programsprobabilistic strategiesGödel numbering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Algorithms in computer science (68W99) Turing machines and related notions (03D10)

Recommendations

• Probabilistic inductive inference
• INDUCTIVE INFERENCE OF LIMITING PROGRAMS WITH BOUNDED NUMBER OF MIND CHANGES
• Memory limited inductive inference machines
• Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings
• scientific article; zbMATH DE number 1283992

Cites work

• scientific article; zbMATH DE number 3655912 (Why is no real title available?)
• scientific article; zbMATH DE number 3702094 (Why is no real title available?)
• scientific article; zbMATH DE number 3531360 (Why is no real title available?)
• scientific article; zbMATH DE number 3573853 (Why is no real title available?)
• scientific article; zbMATH DE number 3604877 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3420728 (Why is no real title available?)
• Inductive Inference and Computable One‐One Numberings
• Inductive inference of automata, functions and programs
• Limiting recursion
• Monadic Elementary Formal Systems
• Research in the theory of inductive inference by GDR mathematicians - A survey
• The Power of Pluralism for Automatic Program Synthesis
• Toward a mathematical theory of inductive inference

Cited in

(26)

• Taming teams with mind changes
• Aspects of complexity of probabilistic learning under monotonicity constraints
• Quantum inductive inference by finite automata
• The synthesis of language learners.
• Learning recursive functions: A survey
• Probabilistic inductive inference: A survey
• Probability and plurality for aggregations of learning machines
• Probabilistic language learning under monotonicity constraints
• Training sequences
• scientific article; zbMATH DE number 408784 (Why is no real title available?)
• Investigations on measure-one identification of classes of languages
• Memory limited inductive inference machines
• scientific article; zbMATH DE number 2080445 (Why is no real title available?)
• On the influence of technology on learning processes
• Simulating teams with many conjectures
• On the inference of approximate programs
• Probabilistic limit identification up to ``small sets
• The power of probabilism in Popperian FINite learning
• Inductive inference of recursive functions: complexity bounds
• Identification of probabilities
• Probabilistic language learning under monotonicity constraints
• Probabilistic inductive inference
• Parallel learning of automatic classes of languages
• Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings
• Trade-off among parameters affecting inductive inference
• Probabilistic and pluralistic learners with mind changes

This page was built for publication: On the power of probabilistic strategies in inductive inference

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