Alan turing's concept of computability
DOI:
https://doi.org/10.15381/risi.v15i2.24781Keywords:
Computability, Recursion, Algorithm, Church-Turing Thesis, Turing theoryAbstract
We reflect on the concept of computability, concepts defined in the 1930s, based on the well-known Church-Turing thesis; which says that a recursive mathematical function is equivalent to what is executed by the Turing machine that contains the algorithm ides, an intuitive notion of sequence instructions. From a critical perspective (therefore philosophical), we consider that the Church-Turing thesis does not fully contain the theory of computability professed by Alan Turing, that Turing's ideas have a broader meaning.
Downloads
Downloads
Published
Issue
Section
License
Copyright (c) 2022 Miguel Salinas Molina
This work is licensed under a Creative Commons Attribution 4.0 International License.
AUTHORS RETAIN THEIR RIGHTS:
a. Authors retain their trade mark rights and patent, and also on any process or procedure described in the article.
b. Authors retain their right to share, copy, distribute, perform and publicly communicate their article (eg, to place their article in an institutional repository or publish it in a book), with an acknowledgment of its initial publication in the Revista de investigación de Sistemas e Informática.
c. Authors retain theirs right to make a subsequent publication of their work, to use the article or any part thereof (eg a compilation of his papers, lecture notes, thesis, or a book), always indicating its initial publication in the Revista de investigación de Sistemas e Informática (the originator of the work, journal, volume, number and date).
