Aggregating inductive expertise on partial recursive functions (Q1187022)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Aggregating inductive expertise on partial recursive functions |
scientific article; zbMATH DE number 37519
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Aggregating inductive expertise on partial recursive functions |
scientific article; zbMATH DE number 37519 |
Statements
Aggregating inductive expertise on partial recursive functions (English)
0 references
28 June 1992
0 references
The paper investigates the power of inductive inference performed by a team of more than three inference machines working on the same problem and supervised by a team head (the aggregator). The team head identifies the solution if the majority of the team reach the same solution. The main focus is on how much information the team members have to offer to the aggregator in order that this one correctly identifies the solution. The paper is a companion to an earlier one by \textit{O. N. Osherson, M. Stob} and \textit{S. Weinstein} [Inf. Control 70, 69-95 (1986; Zbl 0612.68077)], by offering supplementary results, mainly for the case when partial recursive functions are inferred (this situation has not been approached in the above-cited paper).
0 references
inductive inference
0 references
inference machines
0 references
partial recursive functions
0 references