Follow
Andrey Nechesov
Andrey Nechesov
PhD, Reseacher in Sobolev Institute of Mathematics, Russia, Novosibirsk
Verified email at math.nsc.ru - Homepage
Title
Cited by
Cited by
Year
Polynomial Analogue of Gandy’s Fixed Point Theorem
S Goncharov, A Nechesov
Mathematics 9 (17), 2021
132021
Solution of the Problem P = L
S Goncharov, A Nechesov
Mathematics 10 (1), 113, 2021
102021
Some questions on polynomially computable representations for generating grammars and Backus–Naur forms
AV Nechesov
Siberian Advances in Mathematics 32 (4), 299-309, 2022
62022
Axiomatization of Blockchain Theory
S Goncharov, A Nechesov
Mathematics 11 (13), 2966, 2023
32023
Semantic programming: method∆ p 0-enrichments and polynomial computable fixed points
A Nechesov
Url: https://arxiv. org/abs/1903.08109 Date: March 19, 2019
32019
Polynomial-Computable Representation of Neural Networks in Semantic Programming
S Goncharov, A Nechesov
J 6 (1), 48-57, 2023
22023
Semantic programming for AI and Robotics
S Goncharov, A Nechesov
2022 IEEE International Multi-Conference on Engineering, Computer and …, 2022
22022
Web 3.0 and smart cities
AV Nechesov, RA Safarov
ББК 22.18 С 56, 248, 2022
22022
Delta--new logic programming language and Delta-methodology for p-computable programs on Turing Complete Languages
A Nechesov
arXiv preprint arXiv:1907.07767, 2019
22019
Polynomial-Computable Representation of Neural Networks in Semantic Programming. J 2023, 6, 48–57
S Goncharov, A Nechesov
12023
Blockchain structures and smart contracts in semantic programming
A Nechesov
МАЛЬЦЕВСКИЕ ЧТЕНИЯ, 210-210, 2022
12022
AI-Driven Digital Twins for Smart Cities
S Goncharov, A Nechesov
Engineering Proceedings 58 (1), 94, 2023
2023
Semantic Programming and Polynomially Computable Representations
AV Nechesov
Siberian Advances in Mathematics 33 (1), 66-85, 2023
2023
Semantic programming and polynomially computable representations
AV Nechesov
Matematicheskie Trudy 25 (2), 174-202, 2022
2022
Polynomial analogue of Gandhi's fixed point theorem
A Nechesov
arXiv preprint arXiv:1903.08109, 2019
2019
Semantic programming: method of -enrichments and polynomial analogue of the Gandy fixed point theorem
A Nechesov
arXiv 2019, 2019
2019
Semantic programming: method Δ0p-enrichments and polynomial computable fixed points.
A Nechesov
CoRR, 2019
2019
Delta Crypto Platform
A Nechesov
2018
TASK APPROACH IN ARTIFCIAL INTELLIGENCE: LEARNING THEORY AND KNOWLEDGE HIERARCHY
AV NECHESOV
Институт математики им. СЛ Соболева СО РАН КОНФЕРЕНЦИЯ: 13–17 ноября 2023 …, 0
Delta-new logic programming language.
A Nechesov
The system can't perform the operation now. Try again later.
Articles 1–20