OK Twitter. Here's an odd one: Suppose I have a giant pile of unknown functions on, maybe 1-3 inputs, with around 1-2 outputs. Frequently these functions will be straightforward: i.e. f(0x80, 0x08) -> 0x88 and f(0x1, 0x3) -> 0x3 (f is just bitwise AND), or ...
So, the functions are defined using example input-output tuples? Then I think you have to optimize for something otherwise you'll just overfit a solution that simply memoizes the example tuples and does something random in the cases not included in your set of example inputs.
-
-
Good point. I'm starting to lean towards using my superoptimizer despite the fact that this is effectively a 3rd order recursive usage of the superoptimizer.
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.