3 ms·
While it's an interesting approach to implementing it, this feels like it's functionally equivalent to "Brute force execution with memoization". Specifically, i
by Liquid_Fire 5y ago
While it's an interesting approach to implementing it, this feels like it's functionally equivalent to "Brute force execution with memoization". Specifically, it's like a depth-first search, and the set you have at each stage is equivalent to the set of memoised values you would have with a more typical implementation. Or am I missing something that makes it different?
- reitzensteinm 5y agoYou're not missing anything. It's collapsing the state space at the value level rather than interpreter wide, but it's a similar process. Because it doesn't capture the whole state it is vulnerable to false positives. But that in turn probably makes it more memory efficient. My solution would make Google disappointed in a whiteboard interview, imo.