👉 In computational complexity theory, backwardness is a property of functions that are defined in a way such that if one starts with a small input and iterates over it, eventually all values produced by the function will be smaller than the starting value. This property allows the function to solve problems more efficiently than its predecessor when dealing with large inputs.
