On Tue, Mar 23, 2021 at 9:53 PM James Bowery <[email protected]> wrote: > > I constrained mutations to "algebraic identities" -- which constrains the > paths to the search space. So the evolutionary program synthesis is more > along the lines of a computer algebra system searching for a proof.
If the algebraic identities are a broad enough class to work for general program search, then they're going to map by Curry-Howard type correspondences into logical co-implications in a pretty general quantifier logic (or something similar) ... meaning this is going to be more along the lines of a full-on Automated Theorem Proving system than a computer algebra system -- ben ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/Tf8bb7754cbb517a4-Ma4d8155a78bb2dace2343d67 Delivery options: https://agi.topicbox.com/groups/agi/subscription
