However, it is consistent with current knowledge that there could be a sequence of 3-SAT algorithms, each with running time O(2δin) for a sequence of numbers δi tending towards zero, but where the descriptions of these algorithms are so quickly growing that a single algorithm could not automatically select and run the most appropriate one.
Međutim, to je u skladu sa dosadašnjim znanjem da bi mogla postojati sekvenca 3-SAT algoritama, svaka sa vremenom O(2δin) za sekvencu brojeva δi koja teži nuli, ali gde opisi ovih algoritama rastu tako brzo da najprikladniji algoritam ne bi mogao automatski da se odabere i pokrene.