Hi,

I was wondering:

In complexity theory, why does the function used in reduction need to be computable.

I would greatly appreciate it, if someone could explain this in detail or give some sort of proof for it.

Many thanks.