Abstract
Classes of total recursive functions may be identifiable by a team of strategies, but not by a single strategy, in accordance with a certain identification type (EX, FIN, etc.). Qualitative aspects in composing teams are considered. For each W ∉ EX all recursive strategies can be split into several families so that any team identifying W contains strategies from all the families. For W ∉ FIN the possibility of such splitting depends upon W. The relation between these phenomena and “voting” properties for types EX, FIN, etc. is revealed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Barzdin J., Two Theorems on the Limiting Synthesis of Functions. Theory of Algorithms and Programs, Vol. 1, Latvian State University, 1974. (Russian).
Engelking R., General Topology. Warsaw, Polish Scientific Publishers, 1977.
Pitt L., Smith C., Probability and plurality for aggregations of learning machines. Information and Computation, Vol. 77 (1988), pp. 77–92.
Apsītis K., Freivalds R., Kriķis M., Simanovskis R. a. o., Unions of Identifiable Classes of Total Recursive Functions. “Analogical and Inductive Inference”, International Workshop, Dagstuhl Castle, Germany. Berlin, Springer-Verlag, 1992, pp. 99–107.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Apsītis, K. (1995). Topological considerations in composing teams of learning machines. In: Jantke, K.P., Lange, S. (eds) Algorithmic Learning for Knowledge-Based Systems. Lecture Notes in Computer Science, vol 961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60217-8_8
Download citation
DOI: https://doi.org/10.1007/3-540-60217-8_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60217-0
Online ISBN: 978-3-540-44737-5
eBook Packages: Springer Book Archive