Modern Review of Past Problems in Applied Mathematics and Computer Science



Nash equilibria, computational complexity, P versus NP, proof of concept


In this article we present the novel model of studying the past problems in present. These problems are very well handled by many authors; however, the result remains unproved. The problems are as follows: Nash equilibria in co-operative games and P versus NP theorem by Stephen Cock. We show that there is a solution for both classical problem in a partial case for “P versus NP”-theorem and co-operative games equilibria for all cases. Since partial case for P-NP problem could be proved by showing that Bellman’s dynamic programming (DP) is the most optimal algorithm for composite tasks and problems. We also show that same equation by Bellman within the pre-defined parameter can be valid for both P and NP classes of problem according to the ordered sets of arbitrary variables which are compound to Bellman’s equation, which was studied well in prior works by the same author, who holds the position of IT-analyst at the present time.


Download data is not yet available.

Author Biography

Mirzakhmet Syzdykov, n/a

Born 11/09/84. 2006-2009, aspirant at Institute of Problems in Informatics and Control




How to Cite

Syzdykov, M. (2022). Modern Review of Past Problems in Applied Mathematics and Computer Science. ADVANCED TECHNOLOGIES AND COMPUTER SCIENCE, 1(4), 4–8. Retrieved from



Applied mathematics, computer science and control theory

Most read articles by the same author(s)