One new notation, called the A-prompt permitting, is defined in the Turing re- ducibility, and its basic properties are given, by which we shall show that two r.e. sets A and B are one minimal pairs if and only if B is not A-prompt permitting. It is proved that there are no maximal minimal pairs.