On Baker-Gill-Solovay Oracle Turing Machines and Relativization Barrier
Computational Complexity
2023-11-14 v7
Abstract
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."
Keywords
Cite
@article{arxiv.2112.03677,
title = {On Baker-Gill-Solovay Oracle Turing Machines and Relativization Barrier},
author = {Tianrong Lin},
journal= {arXiv preprint arXiv:2112.03677},
year = {2023}
}
Comments
10 pages