Log In Sign Up

A Simple Elementary Proof of P=NP based on the Relational Model of E. F. Codd

by   Aizhong Li, et al.

The P versus NP problem is studied under the relational model of E. F. Codd. To simplify the problem, a periodic machine is coined as a nondeterministic Turing machine, which only changes its tape head direction at the tape ends. A time T(n) decider nondeterministic Turing machine is reduced to a time O(T(n)*T(n)) periodic machine. For a periodic machine in polynomial time p(n), on an input of length n, its up to exponential number of valid sequences of choices are normalized into a relational model of O(p(n)) shared trichoices. By enumerating all the O(p(n)) shared trichoices, proved by mathematical induction, the periodic machine is simulated in time O(p(n)*p(n)*p(n)*logn) under logarithmic cost criterion by a simple computer program. A simple elementary proof of P=NP is obtained.


page 1

page 2

page 3

page 4


Two theorems about the P versus NP problem

Two theorems about the P versus NP problem be proved in this article (1)...

Postulate-based proof of the P != NP hypothesis

The paper contains a proof for the P != NP hypothesis with the help of t...

Interpretation of NDTM in the definition of NP

In this paper, we interpret NDTM (NonDeterministic Turing Machine) used ...

Separation of P and NP

There have been many attempts to solve the P versus NP problem. However,...

Identities and periodic oscillations of divide-and-conquer recurrences splitting at half

We study divide-and-conquer recurrences of the form f(n) = α ...

Quantum Random Access Stored-Program Machines

Random access machines (RAMs) and random access stored-program machines ...

Machines as Programs: P ≠ NP

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