<--- 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

Abstract  The Theory and Practice of Causal Commutative Arrows Hai Liu 2011 Arrows are a popular form of abstract computation. Being more general than

Abstract The Theory and Practice of Causal Commutative Arrows Hai Liu 2011 Arrows are a popular form of abstract computation. Being more general than

DocID: 1xUZX - View Document

Semidefinite Programming Duality Implications for System Theory and Computation Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University  6 July, 2004

Semidefinite Programming Duality Implications for System Theory and Computation Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 6 July, 2004

DocID: 1vqgc - View Document

Exploit Programming From Buffer Overflows to “Weird Machines” and Theory of Computation Se r g e y B r a t u s , M i c h a e l E . L o c a s t o , M e r e d i t h L . P a t t e r s o n , Le n S a s s a m a n , a n d

Exploit Programming From Buffer Overflows to “Weird Machines” and Theory of Computation Se r g e y B r a t u s , M i c h a e l E . L o c a s t o , M e r e d i t h L . P a t t e r s o n , Le n S a s s a m a n , a n d

DocID: 1uB7r - View Document

A THEORY OF THE LEARNABLE L.G. V a l i a n t Aiken Computation Laboratory Harvard University, Cambridge, Massachusetts  explicit programming.

A THEORY OF THE LEARNABLE L.G. V a l i a n t Aiken Computation Laboratory Harvard University, Cambridge, Massachusetts explicit programming.

DocID: 1uqLL - View Document

Introduction to higher-order computation Nordic Logic School, Stockholm, 2017 Mart´ın H¨otzel Escard´o Theory Group, School of Computer Science University of Birmingham, UK

Introduction to higher-order computation Nordic Logic School, Stockholm, 2017 Mart´ın H¨otzel Escard´o Theory Group, School of Computer Science University of Birmingham, UK

DocID: 1ud4n - View Document