A theorem about automatic programming
Author:
Open Access
- 1 April 1975
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGART Bulletin
- Vol. 51 (51) , 5-8
Abstract
An automatic programming system is a system (usually a programmed computer) that generates a program from partial information about that program (Figure 1). Looked at in this general way, automatic programming systems are hardly new. Assemblers are automatic programming systems. So are compilers, debugging systems, and even loaders. In this paper, I propose to focus on systems that "do more" than such systems in the sense that they require less complete information about the programs they are to generate.Keywords
This publication has 11 references indexed in Scilit:
- Induction, pure and simpleInformation and Control, 1977
- Toward a mathematical theory of inductive inferenceInformation and Control, 1975
- Iterated Limiting Recursion and the Program Minimization ProblemJournal of the ACM, 1974
- Some decidability results on grammatical inference and complexityInformation and Control, 1972
- On the inference of Turing machines from sample computationsArtificial Intelligence, 1972
- Language identification in the limitInformation and Control, 1967
- Trial and error predicates and the solution to a problem of MostowskiThe Journal of Symbolic Logic, 1965
- Limiting recursionThe Journal of Symbolic Logic, 1965
- A formal theory of inductive inference. Part IInformation and Control, 1964
- The Inversion of Functions Defined by Turing Machines1956