I think you could say that the adjective is “pure” if you go for the “pure function”.
I always found out that a function whose output is always the same when the arguments are always the same is called "deterministic." Personally, I feel this is a more descriptive term. I believe that a “pure function” is by definition deterministic, and it seems that a pure function should not have any side effects either. I assume that this is not necessary for all deterministic functions (as long as the return value is always the same for the same arguments).
Wikipedia link: http://en.wikipedia.org/wiki/Deterministic_algorithm
Quote:
Given a particular input, it will always produce the same result, and the base machine will always go through the same sequence of states.
source share