> (Of course, finding the right time/occasion to modulate it is the real challenge).
This is tantamount to saying:
All you have to do to solve a NP-hard[0] problem is to make a polynomial solution. (Of course, proving P = NP is the real challenge).
GP seems to have a legitimate point though. The absence of a workable solution at present does not imply the impossibility of such existing in the not so distant future.
> (Of course, finding the right time/occasion to modulate it is the real challenge).
This is tantamount to saying:
0 - https://en.wikipedia.org/wiki/NP-hardness