Back to Search
Start Over
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
- Source :
-
Journal of Computer & System Sciences . Oct2005, Vol. 71 Issue 3, p308-332. 25p. - Publication Year :
- 2005
-
Abstract
- Abstract: A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared to deterministic algorithmic coordinators. Furthermore, these probabilistic algorithmic coordinators are provably not characterized in power by teams of deterministic ones. An insightful, enumeration technique based, normal form characterization of the classes that are learnable by total computable coordinators is given. These normal forms are for insight only since it is shown that the complexity of the normal form of a total computable coordinator can be infeasible compared to the original coordinator. Montagna and Osherson showed that the competence class of a total coordinator cannot be strictly improved by another total coordinator. It is shown in the present paper that the competencies of any two total coordinators are the same modulo isomorphism. Furthermore, a completely effective, index set version of this competency isomorphism result is given, where all the coordinators are total computable. We also investigate the competence classes of total coordinators from the points of view of topology and descriptive set theory. [Copyright &y& Elsevier]
- Subjects :
- *SET theory
*MATHEMATICS
*MATHEMATICAL logic
*TOPOLOGY
Subjects
Details
- Language :
- English
- ISSN :
- 00220000
- Volume :
- 71
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Journal of Computer & System Sciences
- Publication Type :
- Academic Journal
- Accession number :
- 18286927
- Full Text :
- https://doi.org/10.1016/j.jcss.2004.10.014