6533b873fe1ef96bd12d5575
RESEARCH PRODUCT
Topological considerations in composing teams of learning machines
Kalvis Apsitissubject
Identification (information)Theoretical computer scienceFinRelation (database)Computer sciencebusiness.industryVotingmedia_common.quotation_subjectRecursive functionsArtificial intelligenceType (model theory)businessmedia_commondescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1995-01-01 |