Artificial Intelligence

    

Solving NP-Complete Problem by Simulations.

Authors: Michail Zak

Abstract. The mathematical formalism of quantum resonance combined with tensor product decomposability of unitary evolutions is mapped onto a class of NP-complete combinatorial problems. It has been demonstrated that nature has polynomial resources for solving NP-complete problems and that may help to develop a new strategy for artificial intelligence, as well as to re-evaluate the role of natural selection in biological evolution.

Comments: 5 Pages.

Download: PDF

Submission history

[v1] 2014-05-27 15:31:17

Unique-IP document downloads: 290 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus