> They would have to search the entire space of possible programs that includes infinite syntactically incorrect programs That’s not really how AIs work, at le

> They would have to search the entire space of possible programs that includes infinite syntactically incorrect programs That’s not really how AIs work, at least not the LLMs of today. They aren’t operating on a search space, and they aren’t following or explicitly constrained by any defined rules of grammar (programming or English or otherwise). It’s “just” probabilistic next token generation, it doesn’t care if your language is typed or not.