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

翻译：本文分析对贝克-吉勒-索洛维或塔灵机器的所谓“相对障碍” 。 我们证明“ 平方二亚化” 技术是一种有效的数学验证技术, 但是在提到“ 相对障碍” 时有一些先决条件。