Kalvis Apsītis
- BB75.L. Blum and M. Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125-155, 1975.Google Scholar
Cross Ref
- CS78.J. Case and C. Smith. Anomaly hierarchies of mechanized inductive inference. In Proceedings of #he l Oth Symposium on #he Theory of Compuling, pages 314-319, San Diego, CA, 1978. Google ScholarDigital Library
- CS83.J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25(2):193-220,1983.Google ScholarCross Ref
- DKV92.R. Daley, B. Kalyanasundaram, and M. Velauthapillai. Breaking the probability 1/2 barrier in fin-type learning. In L. Valiant and M. Warmuth, editors, Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pages 203-217. ACM Press, 1992. Google ScholarDigital Library
- DKV93.R. Daley, B. Kalyanasundaram, and M. Velauthapillai. Capabilities of fallible finite learning. In The 1993 Workshop on Computational Learning Theory. The Association for Computing, 1993. Google ScholarDigital Library
- DPVW91.R. Daley, L. Pitt, M. Velauthapillai, and T. Will. Relations between probabilistic and team one-shot learners. In M. Warmuth and L. Valiant, editors, Proceedings of the 1991 Workshop on Computational Learning Theory, pages 228-239, Palo Alto, CA., 1991. Morgan Kaufmann Publishers. Google ScholarDigital Library
- DS86.R.P. Daley and C. H. Smith. On the complexity of inductive inference. Information and Control, 69:12-40, 1986. Google ScholarDigital Library
- Eng89.R. Engelking. General Topology. tteldermann Verlag, Berlin, 1989.Google Scholar
- FSV89.R. Freivalds, C. Smith, and M. Velauthapillai. Trade-offs amongst parameters effecting the inductive inferribility of classes of recursive functions. Information and Computalion, 82(3):323-349, 1989. Google ScholarDigital Library
- FW79.R.V. Freivalds and R. Wiehagen. Inductive inference with additional information. Elek#ronische Informa#ionsverabeitung und Kyberne#ik, 15(4):179-184, 1979.Google Scholar
- Gol67.E.M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.Google ScholarCross Ref
- Kel57.J.L. Kelly. General Topology. D. Van Nostrand Company, Inc, Princeton, New Jersey, 1957.Google Scholar
- KZ91.E. Kinber and T. Zeugmann. One-sided error probabilistic inductive inference and reliable frequency identification. Information and Computation, 92:253-284, 1991. Google ScholarDigital Library
- OSW86.D.N. Osherson, M. Stob, and S. Weinstein. Aggregating inductive expertise. Information and Control, 70:69-95, 1986. Google ScholarDigital Library
- Pit89.L. Pitt. Probab#listic inductive inference. Journal of the A CM, 36(2):383-433, 1989. Google ScholarDigital Library
- PS88.L. Pitt and C. Smith. Probability and plurality for aggregations of learning machines. Information and Computation, 77:77-92, 1988. Google ScholarDigital Library
- Sch86.G. Sehafer. Some results in the theory of effective program synthesis" Learning by defective information. In Lecture Notes in Computer Science, 215. Springer-Verlag, 1986. Google ScholarDigital Library
- Smi82.C.H. Smith. The power of pluralism for automatic program synthesis. Journal of the ACM, 29(4):1144-1165, 1982. Google ScholarDigital Library
- tFK+92.K. Apsitis, R. Freivalds, M. Kriltis, R. Simanovskis, and J. Smotrovs. Unions of identifiable classes of total recursive functions. In K. Jantke, editor, Analogical and Inductive Inference, pages 99-107. Springer-Verlag, 1992. Lecture Notes in Artificial intelligence, No. 642. Google ScholarDigital Library
Index Terms
- Choosing a learning team: a topological approach
Comments