A Simple Elementary Proof of P=NP based on the Relational Model of E. F. Codd
The P versus NP problem is studied under the relational model of E. F. Codd. I found that the term "complete configuration" is unnecessary and harmful in computational complexity theory because of excessive symbol redundancy. For an input, its valid sequences of complete configurations are normalized into a relational model of shared trichoices with no redundancy. To simplify the problem, a polynomial time nondeterministic Turing machine is polynomially reduced to a periodic machine, which only reverses its tape head displacement at the tape ends. By enumerating all the O(p(n)) shared trichoices, a polynomial time p(n) periodic machine is simulated in time O((p(n))^4) under logarithmic cost. A simple elementary proof of P=NP is obtained.