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

Page 299
[154] G. Pullum, Learnability, hyperlearning, and the poverty of the stimulus, Proceedings of the 22nd Annual Meeting of the Berkeley Linguistics Society (J. Johnson, M. Juge, and J. Moxley, eds.), Berkeley Linguistics Society, 1996.
[155] H. Putnam, Probability and confirmation, Mathematics, Matter, and Method, Cambridge University Press, 1975.
[156] ———, What is innate and why: Comments on the debate, Language and Learning (M. Piatelli-Palmarini, ed.), Harvard University Press, 1980.
[157] J. Quinlan, Learning logical definitions from relations, Machine Learning 5 (1990), 239-266.
[158] H. Rogers, Theory of recursive functions and effective computability, McGraw-Hill, 1967, Reprinted, MIT Press 1987.
[159] J. Royer, Inductive inference of approximations, Information and Control 70 (1986), 156-178.
[160] J. Royer, Semantics versus syntax versus computations: Machine models for type-2 polynomial-time bounded functionals, Journal of Computer and System Sciences 54 (1997), 424-436.
[161] J. Royer and J. Case, Subrecursive programming systems: Complexity & succinctness, Birkhäuser, 1994.
[162] W. Rudin, Principles of mathematical analysis, 3rd edition, McGraw-Hill, 1976.
[163] B. Russell, A history of western philosophy, Simon and Schuster, 1945.
[164] ———, Human knowledge: Its scope and limits, Simon and Schuster, 1948.
[165] Y. Sakakibara, Grammatical inference: An old and new paradigm, Algorithmic Learning Theory: Sixth International Workshop (ALT '95), Lecture Notes in Artificial Intelligence, vol. 997, Springer-Verlag, 1995, pp. 1-24.
[166] G. Sankoff and P. Brown, The origins of syntax in discourse: A case study of Tok Pisin relatives, Language 52 (1976), 631-666.
[167] G. Schäfer-Richter, Uber eingabeabhangigkeit und komplexitat yon inferenzstrategien., Ph.D. thesis, RWTH Aachen, 1984.
[168] B. Schieffelin and A. Eisenberg, Cultural variation in children's conversations, Early language: Acquisition and intervention (R. Schiefelbusch and D. Bricker, eds.), University Park Press, 1981.
[169] A. Seth, There is no recursive axiomatization for feasible functionals of type 2, Seventh Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1992, pp. 286-295.

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