References

[1]
Andrey Nechesov, Semantic programming: method enrichments and polynomial computable fixed points.
Url: https://arxiv.org/abs/1903.08109
Date: March 19, 2019, Version: 1.0 
[2]
Goncharov S.S., The computability via definability in semantic modeling.
Url: http://www.pdmi.ras.ru/EIMI/2018/LP/lp_2018abstracts.pdf
Join work with D. Sviridenko and A.Nechesov. Date: May 14, 2018 
[3]
Goncharov S.S., Conditional Terms in Semantic Programming.
In: Sibirian Mathematical Journal, 2017, V 58, No5, P. 794800. 
[4]
Goncharov S.S., Sviridenko D.I., programming.
In: Transl., II.Ser., Am. Math. Soc. 1989. V. 142. P. 101–121. 
[5]
Ershov Yu. L., Goncharov S. S., Sviridenko D. I., Semantic programming
In: Information processing 86: Proc. IFIP 10th World Comput. Cong. Dublin. 1986. V. 10. P. 1113–1120. 
[6]
Ershov Yu. L. "Definability and computability.". 1996
Comments
There are no comments yet.