On the power of probabilistic strategies in inductive inference

DOI10.1016/0304-3975(83)90067-1zbMATH Open0555.68014OpenAlexW1997380360MaRDI QIDQ760795FDOQ760795

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

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

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)

Cites Work

• Toward a mathematical theory of inductive inference
• Inductive inference of automata, functions and programs
• Title not available (Why is that?)
• Monadic Elementary Formal Systems
• The Power of Pluralism for Automatic Program Synthesis
• Limiting recursion
• Title not available (Why is that?)
• Inductive Inference and Computable One‐One Numberings
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (21)

• Probabilistic and pluralistic learners with mind changes
• Title not available (Why is that?)
• Investigations on measure-one identification of classes of languages
• The synthesis of language learners.
• Aspects of complexity of probabilistic learning under monotonicity constraints
• Probabilistic inductive inference
• Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings
• Probability and plurality for aggregations of learning machines
• Parallel learning of automatic classes of languages
• Memory limited inductive inference machines
• Training sequences
• Simulating teams with many conjectures
• The power of probabilism in Popperian FINite learning
• Probabilistic inductive inference: A survey
• Probabilistic language learning under monotonicity constraints
• Learning recursive functions: A survey
• Taming teams with mind changes
• Probabilistic language learning under monotonicity constraints
• On the inference of approximate programs
• Trade-off among parameters affecting inductive inference
• Title not available (Why is that?)

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)