Sorry for the confusing title, but I’m trying to find out if a certain algorithm or class of algorithms fits this description. Given an algorithm
A(x) can be computionally easier if
A(g) is known, where
g is close to
x, and it’s easier the closer
g gets to
x. So also, the amount of computation
A has to do grows with respect to the size of the input.
You would also have to be able to calculate the output of
A exist for anything other than trivial artithemtic, and if so, is there an entire class of algorithms which
A belongs to?