Topological considerations in composing teams of learning machines

  • Kalvis Apsītis
1 Inductive Inference Theory 1.1 Inductive Inference of Recursive Functions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 961)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Barzdin J., Two Theorems on the Limiting Synthesis of Functions. Theory of Algorithms and Programs, Vol. 1, Latvian State University, 1974. (Russian).Google Scholar
  2. [2]
    Engelking R., General Topology. Warsaw, Polish Scientific Publishers, 1977.Google Scholar
  3. [3]
    Pitt L., Smith C., Probability and plurality for aggregations of learning machines. Information and Computation, Vol. 77 (1988), pp. 77–92.Google Scholar
  4. [4]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Kalvis Apsītis
    • 1
  1. 1.Institute of Mathematics and InformaticsUniversity of LatviaRigaLatvia

Personalised recommendations