On Computable Numbers, with an Application to the Entscheidungsproblem

Article Properties
Cite
Turing, A. M. “On Computable Numbers, With an Application to the Entscheidungsproblem”. Proceedings of the London Mathematical Society, vol. s2-42, no. 1, 1937, pp. 230-65, https://doi.org/10.1112/plms/s2-42.1.230.
Turing, A. M. (1937). On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, s2-42(1), 230-265. https://doi.org/10.1112/plms/s2-42.1.230
Turing AM. On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society. 1937;s2-42(1):230-65.
Citations
Citations Analysis
The first research to cite this article was titled On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate and was published in 1939. The most recent citation comes from a 2024 study titled On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate . This article reached its peak citation in 2023 , with 102 citations.It has been cited in 623 different journals, 16% of which are open access. Among related journals, the SSRN Electronic Journal cited this research the most, with 29 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year