This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Finding patterns common to a set of strings. Journal Comp. and System Sciences 21 (1980) 1, 46–62.
Angluin, D. and Smith, C. H.: Inductive inference: Theory and methods. Computing Surveys 15 (1983) 3, 238–269.
Barzdin, Ya. M.: Complexity and frequency solution of some algorithmically unsolvable problems. Doctoral Dissertation, Novosibirsk State Univ., 1971 (in Russian).
Barzdin, Ya. M. and Freivald, R. V.: Prediction and limiting synthesis of recursively enumerable classes of functions. Theory of Algorithms and Programs I, Latvian State Univ., Riga, 1974, 117–128 (in Russian).
Beick, H.-R.: Zur Konvergenzgeschwindigkeit von Strategien der induktiven Inferenz. Elektr. Inf.Verarbeitung und Kybernetik 18 (1982) 3, 163–172.
Beick, H.-R.: Induktive Inferenz mit höchster Konvergenzgeschwindigkeit. Dissertation A, Humboldt-Univ., Berlin, 1984.
Blum, M.: A machine-independent theory of the comlexity of recursive functions. Journal Assoc. Comput. Mach. 14 (1967), 322–326.
Blum, L. and Blum, M.: Toward a mathematical theory of inductive inference. Information and Control 28 (1975), 125–155.
Daley, R. P. and Smith, C. H.: On the complexity of inductive inference. Techn. Rep. 83-4, Univ. of Pittsburgh, 1983.
Freivald, R. V.: On the complexity and optimality of computation in the limit. Theory of Algorithms and Programs II, Latvian State Univ., Riga, 1975, 155–173 (in Russian).
Gold, M.: Limiting recursion. Journal of Symb. Logic 30 (1965), 28–48.
Gold, M.: Language identification in the limit. Information and Control 10 (1967), 447–474.
Gold, M.: Complexity of automaton identification from given data. Information and Control 37 (1978), 302–320.
Jantke, K. P. and Beick, H.-R.: Combining postulates of naturalness in inductive inference. Elektron. Inf.Verarbeitung und Kybernetik 17 (1981) 8/9, 465–484.
Klette, R. and Wiehagen, R.: Research in the theory of inductive inference by GDR mathematicians — a survey. Information Sciences 22 (1980), 149–169.
Schäfer-Richter, G.: Über Eingabeabhängigkeit und Komplexität von Inferenzstrategien. Dissertation, RWTH Aachen, 1984.
Shinohara, T.: Polynomial time inference of extended regular pattern languages. Lecture Notes in Comp. Science 147 (1982), 115–127.
Valiant, L. G.: A theory of the learnable. Proc. of the ACM Symp. on Theory of Computing, 1984, 436–445.
Zeugmann, T.: On the synthesis of fastest programs in inductive inference. Elektron. Inf.Verarbeitung und Kybernetik 19 (1983) 12, 625–642.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wiehagen, R. (1986). How fast is program synthesis from examples. In: Bibel, W., Jantke, K.P. (eds) Mathematical Methods of Specification and Synthesis of Software Systems '85. MMSSS 1985. Lecture Notes in Computer Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16444-8_22
Download citation
DOI: https://doi.org/10.1007/3-540-16444-8_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16444-9
Online ISBN: 978-3-540-39784-7
eBook Packages: Springer Book Archive