Final answer:
The statement is false; there is no recognized concept of 'Big Ell' in algorithmic complexity, and Big O notation is used to describe the limiting behavior of a function, not to generalize from naturals to functions on naturals.
Step-by-step explanation:
The statement 'Big Oh is a higher order version of Big Ell: generalize from naturals to functions on naturals' seems to be a confusion of concepts. In the context of algorithmic analysis and computational complexity, Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. It is typically used to classify algorithms according to how their run time or space requirements grow as the size of the input increases. There is no standard notion of 'Big Ell' in algorithm complexity or mathematical functions. Therefore, this statement is False.