That was a great talk! Especially the walk through he provided on how Neural-guided PS works and how to incorporate LSTMs and GNNs in the program synthesis models was amazing!
Does anyone use time complexity as a constraint? Like, "give me please algorithm for finding substring in string in O(len(str) + len(substr))"? If no, why?
@@mikejason3822 (1) That's not a computer programming language. It's not Turing Complete. It's subrecursive. They even admit they don't have a system for actual programming languages. (2) Where is the formal procedure for producing the program? (3) If the specification is a set of examples, that's ambiguous. You can never be sure if it is what you really intend in general. Only by having a formal system of specification that is nonprocedural can you have an exact specification. (4) How about producing more than one program? (5) I describe on Twitter a formal set of rules for constructing computer programs for Number Theory (primes, factors, deciding and enumerating) written in a Turing Complete language, the PHP programming language, and give 20 examples - 5 in complete detail, 5 in summary utilizing the first 5 as subroutines, and 10 more as a formal specification to consider.
