[Cover] [Contents] [Index] Previous page Next Section

Page 291
[32] J. Case, S. Kaufmann, E. Kinber, and M. Kummer, Learning recursive functions from approximations, Second European Conference on Computational Learning Theory (Paul Vitányi, ed.), Lecture Notes in Artificial Intelligence, vol. 904, Springer-Verlag, 1995, pp. 140-153.
[33] J. Case and C. Lynes, Machine inductive inference and language identification, Proceedings of the 9th International Colloquium on Automata, Languages and Programming (M. Nielsen and E. M. Schmidt, eds.), Lecture Notes in Computer Science, vol. 140, Springer-Verlag, 1982, pp. 107-115.
[34] J. Case and S. Ngo Manguelle, Refinements of inductive inference by Popperian machines, Tech. Report 152, SUNY/Buffalo, 1979.
[35] J. Case and C. Smith, Comparison of identification criteria for machine inductive inference, Theoretical Computer Science 25 (1983), 193-220.
[36] K. J. Chen, Tradeoffs in machine inductive inference, Ph.D. thesis, SUNY/Buffalo, 1981.
[37] ———, Tradeoffs in inductive inference of nearly minimal sized programs, Information and Control 52 (1982), 68-86.
[38] N. Chomsky, Syntactic structures, Mouton & Co., 1957.
[39] ———, Aspects of the theory of syntax, MIT Press, 1965.
[40] ———, Reflections on language, Pantheon, 1975.
[41] ———, Initial states and steady states, Language and Learning (M. Piatelli-Palmarini, ed.), Harvard University Press, 1980.
[42] ———, Rules and representations, Columbia University Press, 1980.
[43] ———, Knowledge of language, Praeger, 1986.
[44] S. Cook, Computability and complexity of higher type functions, Logic from Computer Science (Y.N. Moschovakis, ed.), Springer-Verlag, 1991, pp. 51-72.
[45] N. Cutland, Computability: An introduction to recursive function theory, Cambridge University Press, 1980.
[46] R. Daley, On the error correcting power of pluralism in BC-type inductive inference, Theoretical Computer Science 24 (1983), 95-104.
[47] ———, Transformation of probabilistic learning strategies into deterministic learning strategies, Proceedings of the Workshop on Computational Learning Theory (D. Haussler and L. Pitt, eds.), Morgan Kaufmann, 1988, pp. 157-163.
[48] R. Daley and B. Kalyanasundaram, Capabilities of probabilistic learners with bounded mind changes, Proceedings of the Sixth Annual Conference on Computational Learning Theory, ACM Press, 1993, pp. 182-191.

 
[Cover] [Contents] [Index] Previous page Next Section