predict properties of the program
Gaunt et al. (2016) showed that differentiable interpreter- based program induction is inferior to discrete search-based techniques used by the programming languages community
Building an IPS system requires solving two problems. First , the search problem: to find consistent programs we need to search over a suitable set of possible programs. We need to define the set (i.e., the program space) and search procedure. Second , the ranking problem: if there are multiple programs consistent with the input-output examples, which one do we return?
First, the programs we can synthesize are only the simplest problems on programming competition websites and are simpler than most competition problems. Many problems require more complex algorithmic solutions like dynamic programming and search, which are currently beyond our reach.