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
-
-
Not a superoptimizer, but (most of) the generated programs are reasonably good. The "simple" version of my algo takes ~2 ms on my machine.
Show 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..
Show this thread
End of conversation
New conversation -
-
-
For those reading along: I think BEXT/BDEP came from Yedidya Hilewitz' PhD thesis at Stanford: http://palms.ee.princeton.edu/node/233
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
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.