TY  - EJOU
AU  - 
T1  - Solution of Np-Complete Problems on the Landauer’s Computer
T2  - International Journal of Mathematical Research

PY  - 2013
VL  - 2
IS  - 2
SN  - 2306-2223

AB  - In this article a new kind of classical computer – Landauer’s one is suggested. It is a computer which operates in agreement with Landauer’s Principle (LP). It is characterized by clock rate which is exponentially large in comparison with clock rate of classical computers. It leads to the possibility to use Landauer’s computer for solving of NP-complete problems in appropriate, i.e. polynomial time with the help of ordinary searching algorithms.
KW  - Landauer’s Principle
KW  - Computational complexity
KW  - Clock rate
KW  - Searching algorithm
DO  -