Alan Turing: the logical and physical basis of computing

Half a century after Alan Turing’s death in 1954, we can ask whether computing can go beyond the framework of computability that he set out in his classic 1936 paper On computable numbers, with an application to the Entscheidungsproblem. We shall do so in the light of what Turing himself did, starting with his work in 1936.

Content

Author and article information

Conference

Publication date: June 2004

Publication date (Print): June 2004

Pages: 1-21

Affiliations

[0001]Wadham College, University of Oxford, Oxford OX1 3PN, U.K.

Article

DOI: 10.14236/ewic/TUR2004.1

SO-VID: f401f240-f1ff-405d-9c71-f5041bd13f47

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Alan Mathison Turing 2004: A celebration of his life and achievements

Conference acronym: TUR

Conference number:

Conference location: Manchester University

Conference date: 5 June 2004

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Alan Mathison Turing 2004: A celebration of his life and achievements

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/TUR2004.1

Self URI (journal page): https://ewic.bcs.org/

Celebrating 65 years of The Computer Journal - free-to-read perspectives - bcs.org/tcj65

Alan Turing: the logical and physical basis of computing

Abstract