Algorithms simulating natural phenomena and hypercomputation

The computational power of nature is a mystery, although we have many computational models, but natural phenomena presents various challenges for them every day. NP-Complete and NP-Hard problems demand efficient solutions, but none of these problems are known to have a polynomial time solution. Nature inspired algorithms are playing major role in solving those problems with amazing efficiency. In this paper, I will argue why these algorithms are better and present hypercomputation claims of going beyond Turing machines computation power.