|
A short essay towards if $P$ not equal $NP$
Vladimir V. Rybakovab a 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.
Received: 10.12.2020 Received in revised form: 10.01.2021 Accepted: 12.02.2020
Citation:
Vladimir V. Rybakov, “A short essay towards if $P$ not equal $NP$”, J. Sib. Fed. Univ. Math. Phys., 14:2 (2021), 258–260
Linking options:
https://www.mathnet.ru/eng/jsfu911 https://www.mathnet.ru/eng/jsfu/v14/i2/p258
|
Statistics & downloads: |
Abstract page: | 119 | Full-text PDF : | 84 | References: | 22 |
|