International Journal of Mathematical Research

Published by: Conscientia Beam
Online ISSN: 2306-2223
Print ISSN: 2311-7427
Quick Submission    Login/Submit/Track

No. 2

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

Pages: 11-16
Find References

Finding References


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

Search :
Google Scholor
Search :
Microsoft Academic Search
Cite

Citation: 1

Y. N. Zayko

Export to    BibTeX   |   EndNote   |   RIS

  1. S. Cook, "The complexity of theorem-proving procedures," In. Conference Record of Third Annual ACM Symposium on Theory of Computing, 1971, pp. 151–158.
  2. P. W. Shor, Algoritms for quantum computation: Discrete logarithms and factoring, in Proc. of the 35th annual symp. On foundations of computer sciences. Los Alamitos, CA: IEEE Comp. Soc. Press.
  3. R. Landauer, "Irreversibility and heat generation in the computing process," IBM Journ. Res. Develop., vol. 5, pp. 183 - 191, 1961.
  4. C. H. Bennett, "The thermodynamics of computation – a review," Int. J. Theor Phys., vol. 21, pp. 905-940, 1982.
  5. Y. N. Zayko, On the groundness of the landauer’s principle//in book propagation and processing of information. Germany: LAP Lambert Academic Publishing GmbH & Co KG, Saarbr?cken, 2012.
  6. Y. N. Zayko, "Estimation of the computational capacity of classical computers," Technical Physics Letters, vol. 31, pp. 796 – 798, 2005.
  7. R. W. Keyes, "Miniaturization of electronics and its limits," IBM J. Res. Dev., vol. 32, pp. 24, 1988.
  8. V. L. Broido and O. P. Il’ina, Computer systems, nets and telecommunications, 4th ed. Sanct-Peterbourg: Piter, 2011.
  9. A. Berut, A. Arakelyan, A. Petrocyan, S. Ciliberto, R. Dillenscheider, and E. Lutz, "Experimental verification of landauer’s principle linking information and thermodynamics," Nature, vol. 483, pp. 187 – 189, 08 March 2012 2012.
No any video found for this article.
Y. N. Zayko (2013). Solution of Np-Complete Problems on the Landauer’s Computer. International Journal of Mathematical Research, 2(2): 11-16. DOI:
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.
Contribution/ Originality