To search, Click below search items.


All Published Papers Search Service


DTMNP: Developing A Turing Machine Against for NP issues


Muhammad Aamir Panwar, Sijjad Ali khuhro, Tehseen Mazhar, Salahuddin Saddar, Zulfiqar Ali


Vol. 18  No. 11  pp. 136-140


A basic question that is unsolved in theoretical issues of computer science is NP problems. These problems are interlinked with P issues. In our paper we search for developing a Turing machine that can execute an algorithm for these deep complex issues. Although it is a bit hardware related solutions .our paper we focus on developing an analogy that can describe non-deterministic solutions. An aim to discuss possibilities of analogical transformation for a complex, powerful machine with solid state properties.


NP Graph Representation Nodes a Box model.