On aggregating teams of learning machines
From MaRDI portal
Publication:1367526
DOI10.1016/0304-3975(94)00162-CzbMath0884.68103OpenAlexW2153185970MaRDI QIDQ1367526
Publication date: 29 September 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00162-c
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Computational limits on team identification of languages
- Probability and plurality for aggregations of learning machines
- Gödel numberings of partial recursive functions
- Aggregating inductive expertise
- Probabilistic inductive inference
- The Power of Pluralism for Automatic Program Synthesis
- Periodicity in generations of automata
- The Power of Vacillation in Language Learning
- Criteria of language learning
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit
This page was built for publication: On aggregating teams of learning machines