Semantic programming: method of Delta0p-enrichments and polynomial analogue of the Gandy fixed point theorem. Conference Abstracts
| Conference |
Sixteenth Asian Logic Conference 17-21 Jun 2019 , Nazarbayev University, Nur-Sultan |
||
|---|---|---|---|
| Source | Sixteenth Asian Logic Conference, Nazarbayev University, Nur-Sultan, Kazakhstan, June 17-21, 2019. Compilation, 2019. |
||
| Output data | Year: 2019, Pages: 31-32 Pages count : 2 | ||
| Tags | gandy theorem, polynomial complexity | ||
| Authors |
|
||
| Affiliations |
|
Abstract:
Computer programs fast entered in our life and the questions associated with the execution of these programs have become the most relevant in our days. Programs should work efficiently, i.e. work as quickly as possible and spend as little resources as possible. Most often, such a "measure of efficiency" is the polynomial program execution time of the length of the input data. Such programs have great importance in the direction of smart contracts on blockchain.
In this article will be introduced the method of Delta0p-enrichments which will show how to switch from the usual polynomial model of M0 using Delta0p-enrichments to a model with new properties and new elements so that the new model will also be polynomial.
Cite:
Nechesov A.V.
Semantic programming: method of Delta0p-enrichments and polynomial analogue of the Gandy fixed point theorem.
In compilation Sixteenth Asian Logic Conference, Nazarbayev University, Nur-Sultan, Kazakhstan, June 17-21, 2019.. 2019. – C.31-32.
Semantic programming: method of Delta0p-enrichments and polynomial analogue of the Gandy fixed point theorem.
In compilation Sixteenth Asian Logic Conference, Nazarbayev University, Nur-Sultan, Kazakhstan, June 17-21, 2019.. 2019. – C.31-32.
Identifiers:
No identifiers
Citing:
Пока нет цитирований