Author:
Jain Sanjay,Kötzing Timo,Stephan Frank
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Bārzdiņš, J.A.: Two theorems on the limiting synthesis of functions. Theory of Algorithms and Programs, Latvian State University, Riga, USSR 210, 82–88 (1974)
2. Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Information and Control 28, 125–155 (1975)
3. Case, J.: Periodicity in generations of automata. Mathematical Systems Theory 8, 15–32 (1974)
4. Case, J., Fulk, M.: Maximal machine learnable classes. Journal of Computer and System Sciences 58, 211–214 (1999)
5. Case, J., Jain, S., Manguelle, S.N.: Refinements of inductive inference by Popperian and reliable machines. Kybernetika 30, 23–52 (1994)