Learning secrets interactively. Dynamic modeling in inductive inference

Bārzdiņš, 1971, Prognostication of automata and functions, Information Processing, 1, 81 Bārzdiņš, 1974, Inductive inference of automata, functions and programs, 455 Bārzdiņš, 1974, Two theorems on the limiting synthesis of functions, 82 Blum, 1975, Toward a mathematical theory of inductive inference, Information and Control, 28, 125, 10.1016/S0019-9958(75)90261-2 Blum, 1991, Noninteractive zero-knowledge, SIAM Journal on Computing, 20, 1084, 10.1137/0220068 Case, 1974, Periodicity in generations of automata, Mathematical Systems Theory, 8, 15, 10.1007/BF01761704 Case, 1994, Infinitary self-reference in learning theory, Journal of Experimental and Theoretical Artificial Intelligence, 6, 3, 10.1080/09528139408953778 Case, 1999, Maximal machine learnable classes, Journal of Computer and System Sciences, 58, 211, 10.1006/jcss.1997.1518 Case, 2005, On learning to coordinate: Random bits help, insightful normal forms, and competency isomorphisms, Journal of Computer and System Sciences, 71, 308, 10.1016/j.jcss.2004.10.014 J. Case, T. Kötzing, Dynamic modeling in inductive inference, in: Proc. of ALT (Algorithmic Learning Theory), 2008, pp. 404–418. Case, 1983, Comparison of identification criteria for machine inductive inference, Theoretical Computer Science, 25, 193, 10.1016/0304-3975(83)90061-0 Clark, 1992 Clark, 1996 Clark, 1986, Referring as a collaborative process, Cognition, 22, 1, 10.1016/0010-0277(86)90010-7 Cormen, 2001 Freivalds, 1995, On the intrinsic complexity of learning, Information and Computation, 123, 64, 10.1006/inco.1995.1158 Gold, 1967, Language identification in the limit, Information and Control, 10, 447, 10.1016/S0019-9958(67)91165-5 Hartmanis, 1965, On the computational complexity of algorithms, Transactions of the American Mathematical Society, 117, 285, 10.1090/S0002-9947-1965-0170805-7 T. Kötzing, Abstraction and complexity in computational learning in the limit, PhD thesis, University of Delaware, 2009. Available online at http://pqdtopen.proquest.com/#viewpdf?dispub=3373055. Li, 1997 Minicozzi, 1976, Some natural properties of strong identification in inductive inference, Theoretical Computer Science, 345, 10.1016/0304-3975(76)90087-6 Montagna, 1999, Learning to coordinate: A recursion theoretic perspective, Synthese, 118, 363, 10.1023/A:1005182121401 L. Pitt, Inductive inference, DFAs, and computational complexity, in: Proc. of AII (Analogical and Inductive Inference), 1989, pp. 18–44. Podnieks, 1974, Comparing various concepts of function prediction, 68 Rogers, 1967 Royer, 1994, Subrecursive Programming Systems: Complexity and Succinctness, 10.1007/978-1-4612-0249-3 Wiehagen, 1976, Limes-Erkennung rekursiver Funktionen durch spezielle Strategien, Elektronische Informationverarbeitung und Kybernetik, 12, 93