
МАШИНА ТЮРІНГА ЯК УНІВЕРСАЛЬНИЙ ВИКОНАВЕЦЬ АЛГОРИТМІВ ТА ЇЇ ЗАСТОСУВАННЯ В ПРОЦЕСІ ПОГЛИБЛЕНОГО ВИВЧЕННЯ АЛГОРИТМІЗАЦІЇ І ОСНОВ ПРОГРАМУВАННЯ СТАРШОКЛАСНИКАМИ
Author(s) -
Oleksandr Yashchyk
Publication year - 2016
Publication title -
ìnformacìjnì tehnologìï ì zasobi navčannâ
Language(s) - English
Resource type - Journals
ISSN - 2076-8184
DOI - 10.33407/itlt.v52i2.1365
Subject(s) - turing , executor , non deterministic turing machine , computer science , turing machine , universal turing machine , turing machine examples , super recursive algorithm , informatics , process (computing) , theoretical computer science , artificial intelligence , programming language , engineering , computation , electrical engineering , political science , law
The article discusses the importance of studying the notion of algorithm and its formal specification using Turing machines. In the article it was identified the basic hypothesis of the theory of algorithms for Turing as well as reviewed scientific research of modern scientists devoted to this issue and found the main principles of the Turing machine as an abstract mathematical model. The process of forming information competencies components, information culture and students` logical thinking development with the inclusion of the topic “Study and Application of Turing machine as Universal Algorithm Executor” in the course of Informatics was analyzed.