The significance of the theory of algorithms for the system of modernprofessional education and the metodology of its teaching


https://doi.org/10.15372/PEMW20190212

Full Text:




Abstract

The article explores the role and relevance of the theory of algorithms in the fundamentalization of mathematical education of specialists in the fi of computer science and information technology, trained at vocational schools and higher institutions. In this case, the theory of algorithms appears in two fi the fi fi assumes theory of specifi algorithms (or intuitively-containing theory of algorithms) whereas the second one implies a formal-logical (abstract) theory of algorithms. In the fi case, the theory of algorithms explores algorithms as means for solving specifi problems, and the problem of developing this kind of algorithm is seen as the basic one. This algorithm should be implemented by a modern computer in real time. The second problem assumes comparing different specifi algorithms for solving the same problem in terms of their complexity, mainly in terms of the time required to solve the problem. Due to this fact, the classes of complexity of algorithms P and NP appear followed by the problem of relationships between these classes. These problems are not solved until now. In the second case, the theory of algorithms creates mathematical (abstract) concepts of the algorithm and explores the properties of these concepts. In the 30s and the fi postwar years of the XX century, several abstract concepts of the algorithm, or formalizations of the intuitive understanding of the algorithm, were developed. This is a Turing machine, recursive functions as functions computable by some algorithm, normal algorithms of A. A. Markov. The abstract theory of algorithms establishes the equivalence of these abstract con cepts. The problem of these algorithms existing is seen as the most important one. In particular, the abstract theory of algorithms establishes the absence of algorithms for solving a number of mass problems. This paper describes a methodological system of teaching algorithm theory, taking into ac­count its two intuitive and abstract fields.

About the Author

V. I. Igoshin
Saratov State University
Russian Federation

Vladimir I. Igoshin – doctor of pedagogical sciences, candidate of physical and mathematical sciences, Professor, Department of Mathematics and Mechanics

83 Astrakhanskaya Str., Saratov, 410012



References

1. Igoshin V. I. [Module «mathematical logic» in the system of vocational training]. Professionalnoe obrazovanie v sovremenom mire = Professional education in the modern world, 2017, vol. 7, no. 2, pp. 1018–1022. DOI: 10.153/PEMW20170211.

2. Hart E. W., Sandefur J. (eds.) Teaching and Learning Discrete Mathematics Worldwide: Curriculum and Research, ICME-13 Monographs, 2018, 276 p. https://doi.org/10.1007/978-3-319-70 308-4.

3. Igoshin V. I. Mathematics and Logic: Their Relationship in the Teaching of Mathematics. In: Hart E. W., Sandefur J. (eds.) Teaching and Learning Discrete Mathematics Worldwide: Curriculum and Research, ICME-13 Monographs, 2018, pp. 253–271. DOI: https://doi.org/10.1007/978-3-319-70308-4_16.

4. Beskin N. M. [Problems in Teaching Mathematic]. Matimatika v shkole = Mathematic in school, 1992, no. 4–5, pp. 3–5. (In Russ.)

5. Uspenskii V.A., Semenov A. L. [Theory of algorithms: main discoveries and applications]. Moscow, 1987. (In Russ.)

6. Violant i Holz A. [The Ferma Riddle. A Three-centure Challenge to Mathematics.]. Moscow, 2014, 160 p. (In Russian)

7. Alsina Claudi. [Metro maps and neuron webs]. Moscow, 2014, 144 p. (In Russian)

8. Nievergelt J., Farrar J. C., Reingold E. M. [Computer Approaches to Mathematical Problems]. Moscow, 1977, 160 p. (In Russ.)

9. Igoshin V. I. [Elements of mathematical logic: Textbook for students]. Moscow, 2018, 3rd ed., 320 p. (In Russian)

10. Igoshin V. I. [Mathematical logic: Textbook for students]. Moscow, 2014, 399 p. (In Russ.)

11. Igoshin V. I. [Mathematical logic and theory of algorithms: Textbook for students]. Moscow, 2010, 448 p. (In Russ.)

12. Igoshin V. I. [Logic with elements of mathematical logic]. Saratov, 2004, 144 p. (In Russ.)

13. Igoshin V. I. [Notebook in Mathematical Logic]. Saratov, 2010, 64 p. (In Russ.)

14. Igoshin V. I. [Theory of algorithms: Textbook for students]. Moscow, 2017, 318 p. (In Russ.)

15. Igoshin V. I. [Theory of algorithms: Textbook for students]. Moscow, 2013, 2018, 3rd ed., 320 p. (In Russ.)

16. Igoshin V. I. [Foundations of Algorithms Theory (Lectures for students learning informatics and IT)]. Saratov, 2008, 96 p. (In Russ.)

17. Igoshin V. I., Dubrakova L.A. [Beginning of the course «Theory of algorithms»in the training of future teachers of mathematics and computer science]. Uchitel – uchenik: problem, poiski, nakhodki. Sb. Nauchno-metodicheskikh trudov = Teacher – disciple: problems, searches, finds. Sat. scientific-methodical. labours’, 2008, no. 6, pp. 48–54. (In Russ.)

18. Leibnic G. V. [Works: in 4 vol.]. Moscow, 1984, vol. 3, p. 497. (In Russ.)

19. Igoshin V. I. [Bachelors and post-graduated education of mathematics and infirmatics teachers in discrete mathematical science]. Obrazovanie i nauka = Education and science, 2013, no. 7 (106), pp. 85–100. (In Russ.)

20. Igoshin V. I. [Problems and exercises on mathematical logic and theory of algorithms: Textbook for students]. Moscow, 2008, 304 p. (In Russ.)

21. Igoshin V. I. [Collection of problems on mathematical logic and theory of algorithms: Textbook for students]. Moscow, 2017, 392 p. (In Russ.)


Supplementary files

For citation: Igoshin V.I. The significance of the theory of algorithms for the system of modernprofessional education and the metodology of its teaching. Professional education in the modern world. 2019;9(2):2753-2764. https://doi.org/10.15372/PEMW20190212

Views: 444

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 2224-1841 (Print)