DeepAI AI Chat
Log In Sign Up

Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine

by   Tianrong Lin, et al.

The diagonalization technique was invented by Georg 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 L_d not accepted by any polynomial-time deterministic Turing machines but accepted by a nondeterministic Turing machine working within O(n^k) for any k∈ℕ_1. By this, we further show that L_d∈𝒩𝒫 . That is, we present a proof that 𝒫 and 𝒩𝒫 differ.


page 1

page 2

page 3

page 4


Encoding Turing Machines into the Deterministic Lambda-Calculus

This note is about encoding Turing machines into the lambda-calculus....

Some Remarks on Real-Time Turing Machines

The power of real-time Turing machines using sublinear space is investig...

Resolution of the Linear-Bounded Automata Question

This work resolve a longstanding open question in automata theory, i.e. ...

A Turing machine simulation by P systems without charges

It is well known that the kind of P systems involved in the definition o...

Universal Memcomputing Machines

We introduce the notion of universal memcomputing machines (UMMs): a cla...

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

This work analysis the so-called "Relativization Barrier" with respect t...

Machines as Programs: P ≠ NP

The Curry-Howard correspondence is often called the proofs-as-programs r...