Open AccessSolution of Np-Complete Problems on the Landauer’s Computer
Author(s) -
Yuriy Zayko
Publication year - 2013
Publication title -
international journal of mathematical research
Language(s) - English
Resource type - Journals
eISSN - 2311-7427
pISSN - 2306-2223
DOI - 10.18488/journal.24/2013.2.2/24.2.11.16
Subject(s) - computer science , polynomial , theoretical computer science , algorithm , calculus (dental) , mathematics , mathematical analysis , medicine , dentistry
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.