9
In mathematics we would say $f$ is an idempotent function. It's a widely known term and I suppose most TCS people should also recognize it.
1
Ilkka Törmä has already given the answer that $f$ is an idempotent function.
You might want to be aware of the concept of
fixed-points.
A point $c$ is a fixed-point for $f$ if $f(c) = c$, and hence
$$f(f(c)) = f(c) = c.$$
A set of fixed-points is often called a fixed set.
In your scenario, the output of $f$, or
image of $f$, is
a fixed set itself.
Only top voted, non community-wiki answers of a minimum length are eligible
Related Tags
terminology × 93reference-request × 21
graph-theory × 16
cc.complexity-theory × 13
co.combinatorics × 11
ds.algorithms × 10
lo.logic × 8
pl.programming-languages × 7
graph-algorithms × 5
soft-question × 5
computability × 5
fl.formal-languages × 4
optimization × 4
ds.data-structures × 4
np-hardness × 3
complexity-classes × 3
automata-theory × 3
lambda-calculus × 3
approximation-hardness × 3
functional-programming × 3
ho.history-overview × 3
approximation-algorithms × 2
turing-machines × 2
reductions × 2
dc.parallel-comp × 2