The origins of the halting problem
| Autor: | Salvador Lucas |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
Logic
Computer science Printing problem Field (mathematics) Decision problem Theoretical Computer Science Undecidable problem Focus (linguistics) Turing machine symbols.namesake Program termination Computational Theory and Mathematics symbols State (computer science) Halting problem Mathematical economics Turing computer LENGUAJES Y SISTEMAS INFORMATICOS Software computer.programming_language |
| Popis: | [EN] The halting problem is a prominent example of undecidable problem and its formulation and undecidability proof is usually attributed to Turing's 1936 landmark paper. Copeland noticed in 2004, though, that it was so named and, apparently, first stated in a 1958 book by Martin Davis. We provide additional arguments partially supporting this claim as follows: (i) with a focus on computable (real) numbers with infinitely many digits (e.g., pi), in his paper Turing was not concerned with halting machines; (ii) the two decision problems considered by Turing concern the ability of his machines to produce specific kinds of outputs, rather than reaching a halting state, something which was missing from Turing's notion of computation; and (iii) from 1936 to 1958, when considering the literature of the field no paper refers to any "halting problem" of Turing Machines until Davis' book. However, there were important preliminary contributions by (iv) Church, for whom termination was part of his notion of computation (for the lambda-calculus), and (v) Kleene, who essentially formulated, in his 1952 book, what we know as the halting problem now. Partially supported by the EU (FEDER), and projects RTI2018-094403-B-C32, PROMETEO/2019/098. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|