Name
Abstract | ||
|---|---|---|
ing with credit is permitted. To copy otherwise, to republish,to post on servers, or to redistribute to lists, requires specific permission and/or afee. Request permission from Publications Dept, ACM Inc., fax 1+(212) 869-0481,or hpermissions@acm.orgi.This document is maintained by the contributing authors as a means to ensuretimely dissemination of scholarly and technical work on a non-commercial basis.Copyright and all rights therein are maintained by the authors or by other copyright... |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1145/227683.227685 | Journal of the ACM |
Keywords | DocType | Volume |
probabilistic automata,pumping lemma,machine learning,recursion theorem,memory limited learning,kolmogorov complexity,inductive inference | Journal | 42 |
Issue | ISSN | ISBN |
6 | 0004-5411 | 0-89791-611-5 |
Citations | PageRank | References |
31 | 1.43 | 29 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rūsiņš Freivalds | 1 | 249 | 20.26 |
| Efim Kinber | 2 | 421 | 44.95 |
| Carl H. Smith | 3 | 664 | 493.76 |