On the complexity of effective program synthesis
Synthesis of programs of recursive functions from input/output examples is investigated where the synthesis is effective in the sense that one is able to algorithmically determine when the correct program of the function under consideration has been found. Necessary and sufficient conditions are derived that the synthesis can be done if the admissible number of input/output examples is bounded.
Unable to display preview. Download preview PDF.
- /1/.Angluin, D., A note on the number of queries needed to identify regular languages. Inf. and Control 51 (1982), 76–87.Google Scholar
- /2/.Angluin, D. and Laird, P.D., Identifying k-CNF formulas from noisy examples. Tech. Report, Yale Univ., DCS, TR-478, June 1986.Google Scholar
- /3/.Angluin, D. and Smith, C.H., Inductive inference: theory and methods. Compt. Surveys, 15(1983), 237–269.Google Scholar
- /4/.Beick, H.-R., Zur Konvergenzgeschwindigkeit von Strategien der induktiven Inferenz. Elektron. Inf. verarb. Kybern. EIK 18(1982), 163–172.Google Scholar
- /5/.Daley, R.P. and Smith, Carl H., On the complexity of inductive inference. Inf. and Control 69(1986), 12–40.Google Scholar
- /6/.Freivalds, R., Kinber, E.B., and Wiehagen, R., Inductive inference and computable one-one numberings. Z. Math. Logik Grundlag. Math. 28(1982), 463–479.Google Scholar
- /7/.Klette, R. and Wiehagen, R., Research in the theory of inductive inference by GDR mathematicians — a survey. Inform. Sci. 22(1980), 149–169.Google Scholar
- /8/.Theory of algorithms and programs I, II, III (Barzdin, Ya.M., Ed.). Latvian State Univ. Riga, 1974, 1975, 1977 (in Russian).Google Scholar
- /9/.Valiant, L.G., A theory of the learnable, CACM 27(1984), 1134–1142.Google Scholar
- /10/.Wiehagen, R., Characterization problems in the theory of inductive inference. Lect. Notes in Comp. Sci. 63(1978), 494–508.Google Scholar
- /11/.Wiehagen, R., On the complexity of program synthesis from examples. Elektron. Inf. verarb. Kybern. EIK 22 (1986), 305–323.Google Scholar