  This work analyses the so-called "Relativization Barrier" with respect to the
Baker-Gill-Solovay oracle Turing machine. We show that the {\em
diagonalization} technique is a valid mathematical proof technique, but it has
some prerequisites when referring to the "relativization barrier."
