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

Y. N Zayko

International Journal of Mathematical Research, 2013, vol. 2, issue 2, 11-16

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.

Keywords: Landauer’s principle; Computational complexity; Clock rate; Searching algorithm (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://archive.conscientiabeam.com/index.php/24/article/view/2162/3162 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pkp:ijomre:v:2:y:2013:i:2:p:11-16:id:2162

Access Statistics for this article

More articles in International Journal of Mathematical Research from Conscientia Beam
Bibliographic data for series maintained by Dim Michael ().