Foundations of Science 18 (3):545-557 (2013)

Maria Martinez
Aalborg University
In the centenary year of Turing’s birth, a lot of good things are sure to be written about him. But it is hard to find something new to write about Turing. This is the biggest merit of this article: it shows how von Neumann’s architecture of the modern computer is a serendipitous consequence of the universal Turing machine, built to solve a logical problem
Keywords Serendipity  Turing  Turing’s machine  Universal Turing machine   Von Neumann’s architecture
Categories (categorize this paper)
DOI 10.1007/s10699-013-9327-x
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,177
Through your library

References found in this work BETA

On Computable Numbers, with an Application to the N Tscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
The Logic of Modern Physics.Percy Williams Bridgman - 1927 - New York, NY, USA: Arno Press.
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
Grundzüge der theoretischen Logik.D. Hilbert & W. Ackermann - 1928 - Annalen der Philosophie Und Philosophischen Kritik 7:157-157.
A Note on the Entscheidungsproblem.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (1):40-41.

View all 14 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles


Added to PP index

Total views
52 ( #216,322 of 2,499,415 )

Recent downloads (6 months)
1 ( #418,166 of 2,499,415 )

How can I increase my downloads?


My notes