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

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.

MoreLess

Year of publication:	2013
Authors:	Zayko, Yu.N.
Published in:	International Journal of Mathematics Research. - Pak Publishing Group. - Vol. 2.2013, 2, p. 11-16
Publisher:	Pak Publishing Group
Subject:	Landauer’s Principle \| Computational complexity \| Clock rate \| Searching algorithm

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010769155