# Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine

@article{Lin2021DiagonalizationOP, title={Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine}, author={Tianrong Lin}, journal={ArXiv}, year={2021}, volume={abs/2110.06211} }

The diagonalization technique was invented by Cantor to show that there are more real numbers than algebraic numbers, and is very important in computer science. In this work, we enumerate all polynomial-time deterministic Turing machines and diagonalize over all of them by an universal nondeterministic Turing machine. As a result, we obtain that there is a language Ld not accepted by any polynomial-time deterministic Turing machines but accepted by a nondeterministic Turing machine working…

## Figures from this paper

## 3 Citations

The Separation of NP and PSPACE

- Computer ScienceArXiv
- 2021

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.

Resolution of The Linear-Bounded Automata Question

- Computer ScienceArXiv
- 2021

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…

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

- Computer ScienceArXiv
- 2021

It is shown that the diagonalization technique is a valid mathematical proof technique, but it has some prerequisites when referring to “Relativization barrier”.

## References

SHOWING 1-10 OF 41 REFERENCES

The P versus NP Problem

- Computer ScienceArXiv
- 2010

P is a robust class and has equivalent definitions over a large class of computer models because Turing machines, the standard computer model in computability theory, are defined in terms of Turing machines.

Resolution of The Linear-Bounded Automata Question

- Computer ScienceArXiv
- 2021

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…

The complexity of theorem-proving procedures

- Computer Science, MathematicsSTOC
- 1971

It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a…

Two-Tape Simulation of Multitape Turing Machines

- Mathematics, Computer ScienceJACM
- 1966

The trade-off relation between number of tapes and speed of computation can be used in a diagonalization argument to show that, if a given function requires computation time T for a k-tape realization, then it requires at most computation time log T log log log for a two-Tape realization.

A hierarchy for nondeterministic time complexity

- Mathematics, Computer ScienceSTOC
- 1972

For any real numbers r1, r2, 1 ≤ r1 < r2 , there is a set A of strings which has nondeterministic time complexity nr2 but not nondeterdependencies nr1, and the computing devices are non-deterministic multitape Turing machines.

On the Structure of Polynomial Time Reducibility

- Mathematics, Computer ScienceJACM
- 1975

The method of showing density ymlds the result that if P ~ NP then there are members of NP -P that are not polynomml complete is shown, which means there is a strictly ascending sequence with a minimal pair of upper bounds to the sequence.

On Computable Numbers, with an Application to the Entscheidungsproblem

- Mathematics
- 1937

1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. Abbreviated…

Complexity and Real Computation

- Mathematics, Computer ScienceSpringer New York
- 1998

This chapter discusses decision problems and Complexity over a Ring and the Fundamental Theorem of Algebra: Complexity Aspects.

Formal languages and their relation to automata

- Computer ScienceAddison-Wesley series in computer science and information processing
- 1969

The theory of formal languages as a coherent theory is presented and its relationship to automata theory is made explicit, including the Turing machine and certain advanced topics in language theory.

Computers and Intractability: A Guide to the Theory of NP-Completeness

- Computer Science, Mathematics
- 1978

Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge…