On Computable Numbers, with an Application to the Entscheidungsproblem

Proceedings of the London Mathematical Society 42 (1):230-265 (1936)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

1937

DOI

10.2307/2268810

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,824

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On computable numbers with an application to the AlanTuringproblem.C. F. Huws & J. C. Finnis - 2017 - Artificial Intelligence and Law 25 (2):181-203.
Wittgensteins Diagonal-Argument: Eine Variation auf Cantor und Turing.Juliet Floyd - 2018 - In Bromand Joachim & Reichert Bastian, Wittgenstein und die Philosophie der Mathematik. Mentis Verlag. pp. 167-197.
WHAT IS. . . a Halting Probability?Cristian S. Calude - 2010 - Notices of the AMS 57:236-237.
A Turing Machine for Exponential Function.P. M. F. Lemos - manuscript
Turing, Matthews and Millikan: Effective Memory, Dispositionalism and Pushmepullyou Mental States.Eli Dresner - 2012 - International Journal of Philosophical Studies 20 (4):461-472.
“Surveyability” in Hilbert, Wittgenstein and Turing.Juliet Floyd - 2023 - Philosophies 8 (1):6.
Wittgenstein on ethics: Working through Lebensformen.Juliet Floyd - 2020 - Philosophy and Social Criticism 46 (2):115-130.
Turing A. M.. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society, 2 s. vol. 42 , pp. 230–265. [REVIEW]Alonzo Church - 1937 - Journal of Symbolic Logic 2 (1):42-43.
A. M. Turing. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society, 2 s. vol. 42 (1936–1937), pp. 230–265. [REVIEW]Everett J. Nelson & V. C. Aldrich - 1937 - Journal of Symbolic Logic 2 (1):42-43.
Mechanists of the Revolution: The Case of Edison and Bell.Anthony F. Beavers - unknown

Analytics

Added to PP
2010-08-17

Downloads
700 (#41,761)

6 months
89 (#79,019)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the proper treatment of connectionism.Paul Smolensky - 1988 - Behavioral and Brain Sciences 11 (1):1-23.
Unity of Science as a Working Hypothesis.Paul Oppenheim & Hilary Putnam - 1958 - Minnesota Studies in the Philosophy of Science 2:3-36.
Representation and Invariance of Scientific Structures.Patrick Suppes - 2002 - CSLI Publications (distributed by Chicago University Press).

View all 719 citations / Add more citations

References found in this work

No references found.

Add more references