1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.LO2024
Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
Andrey Nechesov
In this work, a functional variant of the polynomial analogue of the classical Gandy's fixed point theorem is obtained. Sufficient conditions have been found to ensure that the com…
cs.LO2019★ 1 cited
Delta -- new logic programming language and Delta-methodology for p-computable programs on Turing Complete Languages
Andrey Nechesov
In paper describes the new logic programming language Delta, which have a many good properties. Delta-programs is p-computable, verifiable and can translation on other languages. A…
cs.CC2019
Polynomial analogue of Gandhi's fixed point theorem
Andrey Nechesov
The problem to be solved in this paper is to construct a general method of proving whether a certain set is p-computable or not. The method is based on a polynomial analogue of the…