3 ms·
Neat. How many of the solution programs were originally hand-written vs machine generated from other known solutions or actually "mined"? Reading through https
by nixpulvis 5y ago
Neat.
How many of the solution programs were originally hand-written vs machine generated from other known solutions or actually "mined"? Reading through https://github.com/loda-lang/loda-cpp/blob/main/miners.default.json https://github.com/loda-lang/loda-cpp/blob/main/miners.defau..., it seems like the "template" for each generator could have been minted one way or another. I'm a little curious now...
It's kinda fun to see a program minimizer in ~200LoC++, but I wonder what other optimization tricks would be worth implementing for the purposes of integer sequence search? I wonder if it would be worth wiring up a proper compiler framework? Or are there other projects that already do this kind of thing faster?
Instead of just "matching" it might be cool to sort these solutions by similarity and then compare that to the similarity of the sequences themselves.
Finally, given that the OEIS databases exists with "FORMULA" (on every entry?), wouldn't it be faster to just parse that? Maybe you'd find some bugs?
- ckrause 5y agoLODA uses an interpreter at the moment. The problem with a compiler framework is: during mining, you need to generate LOTS of programs and evaluate them quickly. Compilation just takes too long for mining. We don't want to parse descriptions or formulas from OEIS. The goal is to do mining just based on the numbers. It is easy to translate a formula into a program. But that's not the goal. The goal is to find NEW or BETTER formulas / algorithms.