Preview
Unable to display preview. Download preview PDF.
References
D. Angluin and C. Smith, A survey of inductive inference: theory and methods, Computing Surveys 15 (1983), 237–269
Theory of algorithms and programs; I, II, III, Ya. M. Barzdin ed. Latvian State University, Riga, (1974), (1975), (1977) (in russian)
Ya. M. Barzdin, personal communication
M. Blum, Machine independent theory of complexity of recursive functions, J. ACM 14 (1967), 322–336
L. Blum and M. Blum, Toward a mathematical theory of inductive inference, Inf. and Control 28 (1975), 122–155
J. Case and C. Smith, Comparison of identification criteria for machine inductive inference, Theoret. Comp. Sci. (1983), 193–220
E. M. Gold, Limiting recursion, J. Symbolic Logic 30 (1965), 28–48
J. P. Helm, On effectively computable operators. Z. Math. Logik Grundlagen Math. 17 (1971), 231–244
R. Klette and R. Wiehagen, Research in the theory of inductive inference by GDR mathematicians — a survey, Inf. Science 22 (1980) 149–169
R. Lindner, Algorithmische Erkennung, Dissertation B, Friedrich Schiller Universität Jena, 1972
N. Minicozzi, Some natural properties of strong-identification in inductive inference. Theoret. Comp. Sci. 2 (1976), 345–360
D. Osherson, M. Stob and S. Weinstein, Systems that learn, MIT Press, Cambridge, Mass., 1986
H. Jr. Rogers, Theory of recursive functions and effective computability, McGraw Hill, New York 1967
B.A. Trakhtenbrot and Ya. M. Barzdin, Finite automata-behavior and synthesis, fundamental studies in computer science 1 (North-Holland, American Elsevier, 1975)
R. Wiehagen, personal communication
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zeugmann, T. (1987). On barzdin's conjecture. In: Jantke, K.P. (eds) Analogical and Inductive Inference. AII 1986. Lecture Notes in Computer Science, vol 265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18081-8_96
Download citation
DOI: https://doi.org/10.1007/3-540-18081-8_96
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18081-4
Online ISBN: 978-3-540-47739-6
eBook Packages: Springer Book Archive