In Chap 34.3 NP-completeness and reducibility of the book, Introduction to Algorithm(3rd Edition), the author states(the original text):
We call the function f the reduction function, and a polynomial-time algorithm F that computes f is a reduction algorithm.
In my mind, function should be a machine dependent implementation(a set of instructions) of the algorithm. Why does he say algorithm computes function?