Only Polynomially bounded algorithm does not suffice.

I have been thinking about my first post for long time. Although I mentioned that predicting the future by pure computation is NP-hard problem, I was not satisfied. Intuitively, the problem is much more harder. And here is the idea how it is.

Since the life is a real time process or it runs in linear time, to know the future in polynomial time is not a sufficient condition. The computation should be done in Linear time Algorithm. As we suspect that P=NP isn't true, it is near to impossible that the NP-hard problem can be solved optimally in polynomial time algorithm. (Again this is a conjecture). And solving a NP-hard problem in a linear time looks more near to impossible. Hence its much harder.