I've been looking into ∃∀-solvers for program synthesis as well as SyGuS tools lately. Unfortunately I'm not very impressed.
-
Show this thread
-
But my ad-hoc tree search for gen programs for bit permutations using ROT, GREV, and EXT/DEP works really well: http://nbviewer.jupyter.org/url/svn.clifford.at/handicraft/2017/permsyn/data.ipynb …pic.twitter.com/gP1Exkubgj
2 replies 1 retweet 12 likesShow this thread -
Not a superoptimizer, but (most of) the generated programs are reasonably good. The "simple" version of my algo takes ~2 ms on my machine.
1 reply 0 retweets 1 likeShow this thread
I'm sure that can be further optimized by at least an order of magnitude. I did not optimize my code for performance at all..
4:57 AM - 4 Oct 2017
0 replies
0 retweets
1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.