Geodesic
A short essay towards if $P$ not equal $NP$
Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 14 (2021) no. 2, pp. 258-260

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{JSFU_2021_14_2_a13,
     author = {Vladimir V. Rybakov},
     title = {A short essay towards if $P$ not equal $NP$},
     journal = {\v{Z}urnal Sibirskogo federalʹnogo universiteta. Matematika i fizika},
     pages = {258--260},
     publisher = {mathdoc},
     volume = {14},
     number = {2},
     year = {2021},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JSFU_2021_14_2_a13/}
}
TY  - JOUR
AU  - Vladimir V. Rybakov
TI  - A short essay towards if $P$ not equal $NP$
JO  - Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
PY  - 2021
SP  - 258
EP  - 260
VL  - 14
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JSFU_2021_14_2_a13/
LA  - en
ID  - JSFU_2021_14_2_a13
ER  - 
%0 Journal Article
%A Vladimir V. Rybakov
%T A short essay towards if $P$ not equal $NP$
%J Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
%D 2021
%P 258-260
%V 14
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JSFU_2021_14_2_a13/
%G en
%F JSFU_2021_14_2_a13
Vladimir V. Rybakov. A short essay towards if $P$ not equal $NP$. Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 14 (2021) no. 2, pp. 258-260. http://geodesic.mathdoc.fr/item/JSFU_2021_14_2_a13/