TURING MACHINE AS UNIVERSAL ALGORITHM EXECUTOR AND ITS APPLICATION IN THE PROCESS OF HIGH-SCHOOL STUDENTS` ADVANCED STUDY OF ALGORITHMIZATION AND PROGRAMMING FUNDAMENTALS

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...

Full description

Saved in:
Bibliographic Details
Published in:Information technologies and learning tools Vol. 52; no. 2; pp. 10 - 17
Main Author: Oleksandr B. Yashchyk
Format: Journal Article
Language:English
Russian
Published: Institute for Digitalisation of Education of the NAES of Ukraine 01.05.2016
Subjects:
алгоритмізація та основи програмування
виконавець алгоритму
машина Тюрінга
поглиблене вивчення
програмні засоби
ISSN:2076-8184, 2076-8184
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2076-8184
2076-8184
DOI:10.33407/itlt.v52i2.1365