Turing reduction
The definition of NP-easy uses a Turing reduction rather than a many-one reduction because the answers to problem "Y" are only TRUE or FALSE, but the answers to problem "X" can be more general. Therefore, there is no general way to translate an instance of "X" to an instance of "Y" with the same answer.