Simulating teams with many conjectures
From MaRDI portal
Publication:6083911
DOI10.1007/3-540-60454-5_39zbMath1527.68106MaRDI QIDQ6083911
Mahendran Velauthapillai, Bala Kalyanasundaram
Publication date: 8 December 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Computational learning theory (68Q32) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- Comparison of identification criteria for machine inductive inference
- On the power of probabilistic strategies in 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
- A theory of the learnable
- On the complexity of inductive inference
- Probabilistic inductive inference
- The Power of Pluralism for Automatic Program Synthesis
- Toward a mathematical theory of inductive inference
- Probabilistic and pluralistic learners with mind changes
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Simulating teams with many conjectures