I figured this seemed too good to be true. In fact, isn't there a simple reduction to the halting problem? Make a "sequence"
i -> M halts in i steps
for an arbitrary Turing Machine `M`. You can implement the "bit lookups" by simulating `M`. The author says their Swift code can run `anySatisfy` on this "sequence" in finite time, right?EDIT: quoted at the top, but afaict not mentioned later, the article says,
>> It is well known that it is impossible to define equality between arbitrary functions. However, there is a large class of functions for which we can determine equality
It would have been nice if the author had been explicit about the class of functions for which their program terminates.