Open AccessLogical language of description of polynomial computing
Author(s) -
Сергей Савостьянович Гончаров,
Д. И. Свириденко
Publication year - 2019
Publication title -
doklady akademii nauk. rossijskaâ akademiâ nauk
Language(s) - English
Resource type - Journals
ISSN - 0869-5652
DOI - 10.31857/s0869-5652485111-14
Subject(s) - term (time) , value (mathematics) , polynomial , computer science , truth value , mathematics , algebra over a field , calculus (dental) , algorithm , theoretical computer science , programming language , pure mathematics , mathematical analysis , physics , medicine , dentistry , quantum mechanics , machine learning
An expansion of the term concept and, accordingly, the formula due to new operators were constructed. These extensions of the language preserve the expressiveness of S-formulas, and at the level of D0-formulas and terms, they ensure the polynomiality of algorithms for calculating the value of a term and the truth of a D0-formula.