TWO APPROACHES IN COMPUTER SCIENCE
Abstract
This work is devoted to a very relevant topic for those engaged in computer science: different approaches to the process of setting and solving problems in computer science. The paper considers two approaches to solving problems on a computer: 1) in the so-called calculus of the problem 2) when working with the field of meaningful problems. The advantages and disadvantages of these approaches, their practical significance are considered.
About the Authors
A. A. Moskvitin
Stavropol State Pedagogical Institute
Russian Federation
Russian Federation
K. F. Samokhvalov
Institute of mathematics
Russian Federation
Russian Federation
A. B. Cheboksarov
Stavropol State Pedagogical Institute
Russian Federation
Russian Federation
References
1. Москвитин А.А. Задачный подход в информатике. - Новосибирск, НГУ, 2000. -200 с.
2. Казаков К.В., Москвитин А.А., Самохвалов К.Ф. Проект разработки языков спецификации задач, ориентированных на пользователя // Модели когнитивных процессов. - Новосибирск, 1997. - Вып. 158: Вычислительные системы. - С. 63-94.
3. Ершов Ершова Ю.Л. Динамическая логика над допустимыми множествами. ДАН СССР, 1983. Т. 273 N 5. С. 1045-1048.
4. Kolmogoroff A. Zur Deutung der intuitionistischen Logic. - Heiting, Die formalin Regelen der intuitionistischen Logik, Sitzel. Pens. Anad. (1930), I, S. 42: II. S. 57; III.S.158.
Review
For citations:
Moskvitin A.A., Samokhvalov K.F., Cheboksarov A.B. TWO APPROACHES IN COMPUTER SCIENCE. Modern Science and Innovations. 2019;(4):261-275. (In Russ.)
Views:
54
Email this article 