<--- Back to Details
First PageDocument Content
Computer science / Mathematics / Alan Turing / Turing machine / Church–Turing thesis / Computable function / Halting problem / Computable number / Computability / Computability theory / Theory of computation / Theoretical computer science
Date: 2011-01-10 14:18:09
Computer science
Mathematics
Alan Turing
Turing machine
Church–Turing thesis
Computable function
Halting problem
Computable number
Computability
Computability theory
Theory of computation
Theoretical computer science

Alan Turing: the logical and physical basis of computing Andrew Hodges∗ Wadham College, University of Oxford, Oxford OX1 3PN, U.K. This paper is based on the talk given on 5 June 2004 at the conference at Manchester Un

Add to Reading List

Source URL: www.bcs.org

Download Document from Source Website

File Size: 173,61 KB

Share Document on Facebook

Similar Documents

Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡  Abstract

Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡ Abstract

DocID: 1qlxM - View Document

PDF Document

DocID: 1pZ37 - View Document

A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009

A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009

DocID: 1pMn0 - View Document

Microsoft Word - IBSAlgorithms.doc

Microsoft Word - IBSAlgorithms.doc

DocID: 1p3sE - View Document

Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,

Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,

DocID: 1oyBY - View Document