Simulating teams with many conjectures

DOI10.1007/3-540-60454-5_39MaRDI QIDQ6083911zbMATH OpenFDO

Authors Bala Kalyanasundaram, Mahendran Velauthapillai

Publication date 8 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60454-5_39

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Computational learning theory (68Q32)

Recommendations

• Taming teams with mind changes
• Learning behaviors of functions with teams
• Probabilistic and pluralistic learners with mind changes
• Hierarchies of probabilistic and team FIN-learning
• scientific article; zbMATH DE number 4080947

Cites work

• A theory of the learnable
• Breaking the probability \({1\over 2}\) barrier in FIN-type learning
• Comparison of identification criteria for machine inductive inference
• scientific article; zbMATH DE number 3833940 (Why is no real title available?)
• scientific article; zbMATH DE number 3655912 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 1351109 (Why is no real title available?)
• scientific article; zbMATH DE number 3420728 (Why is no real title available?)
• Language identification in the limit
• On the complexity of inductive inference
• On the power of probabilistic strategies in inductive inference
• Probabilistic and pluralistic learners with mind changes
• Probabilistic inductive inference
• Probability and plurality for aggregations of learning machines
• The Power of Pluralism for Automatic Program Synthesis
• Toward a mathematical theory of inductive inference
• Trade-off among parameters affecting inductive inference

This page was built for publication: Simulating teams with many conjectures

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