However, proving lower bounds is much more difficult, since lower bounds make a statement about all possible algorithms that solve a given problem.
What is the colloquial phrase used to convey the continuum of algorithms with unlimited availability irrespective of time? 
all possible algorithms