RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Bel'tyukov, Anatoly Petrovich

Statistics Math-Net.Ru
Total publications: 19
Scientific articles: 17

Number of views:
This page:2043
Abstract pages:4142
Full texts:1452
References:221
Professor
Doctor of physico-mathematical sciences (1993)
Speciality: 05.13.17 (Theoretical foundation for informatics)
Birth date: 04.12.1952
E-mail:
Website: http://ulm.uni.udm.ru/~belt
Keywords: complexity of computation; complexity classes; subrecursive classes; subrecursive hierarchies; intuitionistic mathematics; mathematics of constructive systems; mechanization of proofs; complexity of proofs; models of computation; substructural logics; weak arithmetics; logic in computer science.

Subject:

Decidability of universal theory of addition and divisibility of natural numbers is proved (1976). Machine (iterative) descriptions of the initial Grzegorczyk classes are obtained (1976–1979). Absence of a finite basis of one-argument funcions of the Grzegorczyk class $\cal E^0$ with respect to superposition is proved (1979). Formal theories for generating akgorithms to solve given tasks with given computational complexity are constructed. An effective method of deductive synthesis of algorithms containing recursions is created.

Biography

Graduated from Faculty of Mechanics and Mathematics of Leningrad State University. Ph.D. thesis was defended in 1979 ("Some properties of algorithms complexity classes"). D.Sci. thesis was defended in 1993 ("Deductive algorith synthesis considering computing resources").

   
Main publications:
  • Beltiukov A. P. Intuitionistic formal theories with realizability in subrecursive classes // Annals of Pure and Applied Logic, 89, 1997, p. 3–15.
  • Beltiukov A. P. Automatical deductive synthesis of programs with recursions // Lecture Notes in Computer Science, v. 735, 1993, p. 414–422.

http://www.mathnet.ru/eng/person17669
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/304044

Publications in Math-Net.Ru
2020
1. A. Yu. Saparov, A. P. Beltyukov, S. G. Maslov, “Refinement of the results of recognition of mathematical formulas using the Levenshtein distance”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 30:3 (2020),  513–529  mathnet
2019
2. A. P. Bel'tyukov, M. M. Abbasi, “Logical analysis of emotions in text from natural language”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 29:1 (2019),  106–116  mathnet  isi  elib
2016
3. V. V. Zinov'ev, A. P. Bel'tyukov, O. A. Bartenev, “Mathematical model of the photovoltaic converter using the Lambert $W$ function”, Izv. IMI UdGU, 2016, 2(48),  22–30  mathnet  elib
4. A. P. Beltyukov, “Interactive realizations of logical formulas”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 26:2 (2016),  177–193  mathnet  mathscinet  elib
2013
5. A. Yu. Saparov, A. P. Beltyukov, “Mathematical modeling of formula images for their recognition”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2013, 1,  153–167  mathnet
2012
6. A. Yu. Saparov, A. P. Beltyukov, “Regular expressions in the mathematical text recognition problem”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2012, 2,  63–73  mathnet
2010
7. A. P. Beltúkov, S. G. Maslov, “About problems of readers and the process of reading in the electronic environment”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2010, 4,  101–111  mathnet
2009
8. A. P. Beltiukov, S. G. Maslov, O. A. Morozov, “Constructive activities of IT-sphere”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2009, 2,  102–109  mathnet
2007
9. A. P. Beltiukov, “Simple typed functional programming languages”, Vestn. Udmurtsk. Univ. Mat., 2007, 1,  223–234  mathnet
2003
10. A. P. Beltiukov, “Weak constructive second order arithmetic with extracting polynomial time computable algorithms”, Zap. Nauchn. Sem. POMI, 304 (2003),  7–12  mathnet  mathscinet  zmath; J. Math. Sci. (N. Y.), 130:2 (2005), 4571–4573
2001
11. A. P. Beltiukov, “Combined hierarchies of finite random access machines”, Zap. Nauchn. Sem. POMI, 277 (2001),  5–13  mathnet  mathscinet  zmath; J. Math. Sci. (N. Y.), 118:2 (2003), 4943–4947
1982
12. A. P. Beltiukov, “Complexity lower bounds for machine computing models”, Zap. Nauchn. Sem. LOMI, 118 (1982),  4–24  mathnet  mathscinet  zmath
1980
13. A. P. Beltiukov, “Hierarchy of complexity of computation of partial functions with values 0 and 1”, Mat. Zametki, 28:3 (1980),  423–431  mathnet  mathscinet  zmath; Math. Notes, 28:3 (1980), 680–684  isi
1979
14. A. P. Beltiukov, “A machine description and a hierarchy of initial Grzegorczyk's classes”, Zap. Nauchn. Sem. LOMI, 88 (1979),  30–46  mathnet  mathscinet  zmath; J. Soviet Math., 20:4 (1982), 2280–2289
1977
15. A. P. Beltiukov, “A maximal sequence of classes transformable by primitive recursion in a given class”, Zap. Nauchn. Sem. LOMI, 68 (1977),  3–18  mathnet  mathscinet  zmath; J. Soviet Math., 15:1 (1981), 1–10
1976
16. A. P. Beltiukov, “Decidability of the universal theory of natural numbers with addition and divisibility”, Zap. Nauchn. Sem. LOMI, 60 (1976),  15–28  mathnet  mathscinet  zmath; J. Soviet Math., 14:5 (1980), 1436–1444
17. A. P. Beltiukov, “An iterative description of the class $\varepsilon^1$ of Grzegorczyk's hierarchy”, Zap. Nauchn. Sem. LOMI, 60 (1976),  3–14  mathnet  mathscinet  zmath; J. Soviet Math., 14:5 (1980), 1429–1436

2019
18. A. P. Beltyukov, A. A. Gryzlov, D. V. Dyugurov, V. A. Zaitsev, N. N. Petrov, S. N. Popova, V. I. Rodionov, Yu. M. Smetanin, A. D. Yashin, “Nikolai Nikolaevich Nepeivoda. To anniversary”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 29:2 (2019),  295–298  mathnet  zmath  elib
2017
19. A. P. Beltyukov, A. A. Gryzlov, V. Ya. Derr, D. V. Dyugurov, A. I. Karpov, M. A. Klochkov, G. V. Merzlyakova, N. N. Petrov, V. N. Pishkov, S. N. Popova, V. I. Rodionov, “In memory of Galimzyan Gazizovich Islamov (02.02.1948–22.11.2017)”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 27:4 (2017),  634–642  mathnet  elib

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021