JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website
Nechesov, Andrey Vitalievich
Researcher
Candidate of physico-mathematical sciences (2023)
Speciality:
01.01.06 (Mathematical logic, algebra, and number theory)
Birth date:
7.02.1981
Keywords:
polynomial computability semantic programming artificial intelligence.
Subject:
polynomial computability
semantic programming
artificial intelligence
Main publications:
Sergey Goncharov; Andrey Nechesov, “Solution of the Problem P = L”, Mathematics , 10 :1 (2022)
https://www.mathnet.ru/eng/person195515
List of publications on Google Scholar
Publications in Math-Net.Ru Citations
2022
1.
A. V. Nechesov, “Semantic programming and polynomially computable representations”, Mat. Tr. , 25 :2 (2022), 174–202 Siberian Adv. Math. , 33 :1 (2023), 66–85
2
2.
A. V. Nechesov, “Some questions on polynomially computable representations for generating grammars and Backus-Naur forms”, Mat. Tr. , 25 :1 (2022), 134–151
1
Organisations
