Simulating teams with many conjectures

DOI10.1007/3-540-60454-5_39zbMATH Open1527.68106MaRDI QIDQ6083911FDOQ6083911

Mahendran Velauthapillai, Bala Kalyanasundaram

Publication date: 8 December 2023

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

Mathematics Subject Classification ID

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

Cites Work

• 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?)
• Toward a mathematical theory of inductive inference
• Language identification in the limit
• A theory of the learnable
• Probabilistic inductive inference
• The Power of Pluralism for Automatic Program Synthesis
• On the power of probabilistic strategies in inductive inference
• Comparison of identification criteria for machine inductive inference
• On the complexity of inductive inference
• Probability and plurality for aggregations of learning machines
• Trade-off among parameters affecting inductive inference
• Breaking the probability \({1\over 2}\) barrier in FIN-type learning
• Probabilistic and pluralistic learners with mind changes

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)