Solution of Np-Complete Problems on the Landauer’s Computer

Authors

  • Y. N Zayko Stolypin Volga Region Institute of Administration Russian Presidential Academy of National Economy and Public Administration, Saratov, Russia

DOI:

https://doi.org/10.18488/journal.24/2013.2.2/24.2.11.16

Keywords:

Landauer’s principle, Computational complexity, Clock rate, Searching algorithm

Abstract

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.

Downloads

Published

2013-06-10

Issue

Vol. 2 No. 2 (2013)

Section

Articles

How to Cite

Solution of Np-Complete Problems on the Landauer’s Computer. (2013). International Journal of Mathematical Research, 2(2), 11-16. https://doi.org/10.18488/journal.24/2013.2.2/24.2.11.16