Elements of concrete algorithmics: computability and solvability

• Опубліковано в: PROBLEMS IN PROGRAMMING
• Дата: 2020
• Випуск: 2-3
• Сторінки: 198-207
• ISSN: 1727-4907
• Автори та афіліації: O.I. Provotar — Kiev Taras Shevchenko National University; O.O. Provotar — Glushkov Institute of Cybernetics NAS of Ukraine
• Автори: Provotar, O.I., Provotar, O.O.
• Формат: Стаття
• Мова: Українська
• Опубліковано: PROBLEMS IN PROGRAMMING 2020
• Теми: Church thesis; solvability; universal function; UDC 681.3
• Онлайн доступ: https://pp.isofts.kiev.ua/index.php/ojs1/article/view/411
• Назва журналу: Problems in programming

An approach to proving the fundamental results of the theory of recursive functions using specific algorithms is consider. For this, the basic constructions of the algorithm are describing exactly and Church's thesis for more narrow classes of algorithmically computational functions is specifie...