A short essay towards if $P$ not equal $NP$

Vladimir V. Rybakov<sup>ab

a</sup> Siberian Federal University, Krasnoyarsk, Russian Federation
^b A. P. Ershov Institute of Informatics Systems, Novosibirsk, Russian Federation

Abstract: We find a computational algorithmic task and prove that it is solvable in polynomial time by a non-deterministic Turing machine and cannot be solved in polynomial time by any deterministic Turing machine. The point is that our task does not look as very canonical one and if it may be classified as computational problem in standard terms.

Keywords: deterministic computations, non-deterministic computations.

UDC: 512.54

Received: 10.12.2020
Received in revised form: 10.01.2021
Accepted: 12.02.2020

Language: English

DOI: 10.17516/1997-1397-2021-14-2-258-260

Bibliographic databases:

•