ACM Home Page
Please provide us with feedback. Feedback
Capabilities of probabilistic learners with bounded mind changes
Full text PdfPdf (912 KB)
Source Annual Workshop on Computational Learning Theory archive
Proceedings of the sixth annual conference on Computational learning theory table of contents
Santa Cruz, California, United States
Pages: 182 - 191  
Year of Publication: 1993
ISBN:0-89791-611-5
Authors
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 23,   Citation Count: 3
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/168304.168329
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
 
5
R.V. Freivalds, Finite Identification of General Recursive Functions by Probabilistic Strategies, Akademie Verlag, Berlin, 1979.
 
6
E. M. Gold, Language identification in the limit, Informatzon and Control, 10:447-474, 1967.
 
7
M. Krikis, and R.V. Freivalds, Inductive Inference of Total Recursive Functions by Probabilistic and Deterministic Strategies, technical report, YALEU/DCS/TR-936, Nov. 1992.
 
8
9
 
10
11
 
12
 
13
R. Wiehagen, R. Freivalds, and E. Kinber, On the power of probabilistic strategies in inductive inference, Theoretical Computer $czence, 111-113, 1984.


Collaborative Colleagues:
Robert Daley: colleagues
Bala Kalyanasundaram: colleagues