期刊名称:International Journal of Computer Science and Network Security
印刷版ISSN:1738-7906
出版年度:2018
卷号:18
期号:11
页码:136-140
出版社:International Journal of Computer Science and Network Security
摘要: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.