skywalker239

// Ivan Pouzyrevsky, EWSCS'12.

#include <iostream>
#include <functional>
#include <memory>
#include <utility>

// This is a C++ implementation for Seemingly Impossible Functional Program, which in finite time tests whether 
// a computable predicate on binary strings yields True for some binary string. It does so by exhaustive search
// on whole space. Some nasty-nasty tricks like call-by-need can make this algorithm run fast.