Zobrazeno 1 - 10
of 48
pro vyhledávání: '"semantic programming"'
Autor:
Sergey Goncharov, Andrey Nechesov
Publikováno v:
J, Vol 6, Iss 1, Pp 48-57 (2023)
A lot of libraries for neural networks are written for Turing-complete programming languages such as Python, C++, PHP, and Java. However, at the moment, there are no suitable libraries implemented for a p-complete logical programming language L. This
Externí odkaz:
https://doaj.org/article/a1a34c2bf92f4ef9b4d228bc0af62f25
Autor:
Sergey Goncharov, Andrey Nechesov
Publikováno v:
Mathematics, Vol 10, Iss 1, p 113 (2021)
The problems associated with the construction of polynomial complexity computer programs require new techniques and approaches from mathematicians. One of such approaches is representing some class of polynomial algorithms as a certain class of speci
Externí odkaz:
https://doaj.org/article/b33068e527e445c7b40a702f4559f30f
Autor:
Sergey Goncharov, Andrey Nechesov
Publikováno v:
Mathematics, Vol 9, Iss 17, p 2102 (2021)
The paper suggests a general method for proving the fact whether a certain set is p-computable or not. The method is based on a polynomial analogue of the classical Gandy’s fixed point theorem. Classical Gandy’s theorem deals with the extension o
Externí odkaz:
https://doaj.org/article/4f06cf83e9a446d38f4bc3ab950350df
Publikováno v:
Известия Иркутского государственного университета: Серия "Математика", Vol 22, Iss 1, Pp 71-89 (2017)
One of the most notable trends associated with the Fourth industrial revolution is a significant strengthening of the role played by semantic methods. They are engaged in artificial intelligence means, knowledge mining in huge flows of big data, robo
Externí odkaz:
https://doaj.org/article/c92b4ef560194ae2a50186b5be997cf3
Autor:
A.A. Malykh, A.V. Mantsivoda
Publikováno v:
Известия Иркутского государственного университета: Серия "Математика", Vol 21, Iss 1, Pp 89-107 (2017)
In this paper, the concept of locally simple models is considered. Locally simple models are arbitrarily complex models built from relatively simple components. A lot of practically important domains of discourse can be described as locally simple mo
Externí odkaz:
https://doaj.org/article/1eb2c6b8059a40338401db1f9422ba54
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Goncharov Sergey, Andrey Nechesov
Publikováno v:
Mathematics; Volume 10; Issue 1; Pages: 113
Mathematics, Vol 10, Iss 113, p 113 (2022)
Mathematics, Vol 10, Iss 113, p 113 (2022)
The problems associated with the construction of polynomial complexity computer programs require new techniques and approaches from mathematicians. One of such approaches is representing some class of polynomial algorithms as a certain class of speci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::45970a321b131ee52bd6ea3e83180312
https://doi.org/10.3390/math10010113
https://doi.org/10.3390/math10010113
Publikováno v:
Известия Иркутского государственного университета: Серия "Математика", Vol 22, Iss 1, Pp 71-89 (2017)
One of the most notable trends associated with the Fourth industrial revolution is a significant strengthening of the role played by semantic methods. They are engaged in artificial intelligence means, knowledge mining in huge flows of big data, robo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::489cf5d43517bdb82986050683280e96
https://doi.org/10.26516/1997-7670.2017.22.71
https://doi.org/10.26516/1997-7670.2017.22.71