RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Bel'tyukov Anatoly Petrovich

Statistics Math-Net.Ru
Total publications: 15
Scientific articles: 15
Cited articles: 7
Citations in Math-Net.Ru: 8

Number of views:
This page:1415
Abstract pages:2468
Full texts:619
References:96
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
http://www.ams.org/mathscinet/search/author.html?return=viewitems&mrauthid=304044

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

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