Elements of concrete algorithmics: computability and solvability

• Datum: 2020
• Hauptverfasser: Provotar, O.I., Provotar, O.O.
• Format: Artikel
• Sprache: Ukrainisch
• Veröffentlicht: PROBLEMS IN PROGRAMMING 2020
• Schlagworte: Church thesis; solvability; universal function; UDC 681.3
• Online Zugang: 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...