IDEAS home Printed from https://ideas.repec.org/a/ibn/jmrjnl/v12y2020i4p1.html
   My bibliography  Save this article

A Proof “P≠NP” for P vs. NP Problem by Multiple-Tape Turing-Machine

Author

Listed:
  • Yaozhi Jiang

Abstract

P vs. NP problem is very important research direction in computation complexity theory. In this paper author, by an engineer’s viewpoint, establishes universal multiple-tape Turing-machine and k-homogeneous multiple-tape Turing-machine, and by them we can obtain an unified mathematical model for algorithm-tree, from the unified model for algorithm-tree, we can conclude that computation complexity for serial processing NP problem if under parallel processing sometimes we can obtain P=NP in time-complexity, but that will imply another NP, non-deterministic space-complexity NP, i.e., under serial processing P≠NP in space-complexity, and the result is excluded the case of NP problem that there exists a faster algorithm to replace the brute-force algorithm, and hence we can proof that under parallel processing time-complexity is depended on space-complexity, and vice verse, within P vs. NP problem, this point is just the natural property of P vs. NP problem so that “P≠NP ”.

Suggested Citation

  • Yaozhi Jiang, 2020. "A Proof “P≠NP” for P vs. NP Problem by Multiple-Tape Turing-Machine," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 12(4), pages 1-1, August.
    • Handle: RePEc:ibn:jmrjnl:v:12:y:2020:i:4:p:1
    as

    Download full text from publisher

    File URL: http://www.ccsenet.org/journal/index.php/jmr/article/download/0/0/43198/45492
    Download Restriction: no
    File URL: http://www.ccsenet.org/journal/index.php/jmr/article/view/0/43198
    Download Restriction: no
    ---><---

    More about this item

    JEL classification:

    • R00 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General - - - General
    • Z0 - Other Special Topics - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ibn:jmrjnl:v:12:y:2020:i:4:p:1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Canadian Center of Science and Education (email available below). General contact details of provider: https://edirc.repec.org/data/cepflch.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.