• Corpus ID: 244920640

On Baker-Gill-Solovay Oracle Turing Machines and Relativization Barrier

  title={On Baker-Gill-Solovay Oracle Turing Machines and Relativization Barrier},
  author={Tianrong Lin},
This work analysis the so-called “Relativization Barrier” with respect to BakerGill-Solovay oracle Turing machine. We show that the diagonalization technique is a valid mathematical proof technique, but it has some prerequisites when referring to “Relativization barrier”. 
The Separation of NP and PSPACE
This paper shows that NP 6= PSPACE via the premise of NTIME[S(n)] ⊆ DSPACE[S (n)], and then by diagonalization over all polynomial-time nondeterministic Turing machines via universal nondetergetic Turing machine M0 running in O(n ) space for any k ∈ N1.


Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine
It is obtained that there is a language Ld not accepted by any polynomial-time deterministic Turing machines but accepted by a nondeterministic Turing machine working within O(nk) for any k ∈ N1, i.e. Ld ∈ NP .
Resolution of The Linear-Bounded Automata Question
This work resolve a longstanding open question in automata theory, i.e. the linear-bounded automata question ( shortly, LBA question), which can also be phrased succinctly in the language of
Algebrization: A New Barrier in Complexity Theory
This article systematically goes through basic results and open problems in complexity theory to delineate the power of the new algebrization barrier, and shows that almost all of the major open problems---including P versus NP, P versus RP, and NEXP versus P/poly---will require non-algebrizing techniques.
On Computable Numbers, with an Application to the Entscheidungsproblem
This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.
Computational Complexity: A Modern Approach
This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory and can be used as a reference for self-study for anyone interested in complexity.
Georg Cantor and Transcendental Numbers
Kac and Ulam are comparing Cantor's method with Liouville's earlier construction of transcendentals [24, 25] they find Cantor's method to be non-constructive. But Herstein and Kaplansky insist that
The Design and Analysis of Computer Algorithms
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Principles of mathematical analysis
Chapter 1: The Real and Complex Number Systems Introduction Ordered Sets Fields The Real Field The Extended Real Number System The Complex Field Euclidean Spaces Appendix Exercises Chapter 2: Basic
Algebrization: a new barrier in complexity theory
This paper systematically goes through basic results and open problems in complexity theory to delineate the power of the new algebrization barrier, and shows that all known non-relativizing results based on arithmetization -- both inclusions such as IP=PSPACE and MIP=NEXP, and separations such as MAEXP not in P/poly -- do indeed algeBrize.