Part III Michaelmas 2012 COMPUTATIONAL COMPLEXITY Lecture notes

First Page		Document Content
Date: 2013-10-08 12:14:22 Computer science Turing machine Models of computation Alan Turing Universal Turing machine Computability Computational complexity theory Halting problem Church–Turing thesis Theoretical computer science Computability theory Theory of computation		Part III Michaelmas 2012 COMPUTATIONAL COMPLEXITY Lecture notes Add to Reading List Source URL: www.cs.bris.ac.uk Download Document from Source Website File Size: 935,26 KB Share Document on Facebook

	Lecture 1, Tues Jan 17: Course Intro, Church-Turing Thesis ● ● ● DocID: 1xUXq - View Document
	The Church-Turing thesis in a quantum world Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical Physics, University of Cambridge DocID: 1mUGy - View Document
	The Physical Church-Turing Thesis: Modest or Bold?1 Gualtiero Piccinini University of Missouri – St. Louis Email: This is a preprint of a paper whose final and definitive form will be published in DocID: 1lALM - View Document
	Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory Gilles Dowek INRIA, 23 avenue d’Italie, CS 81321, 75214 Paris Cedex 13, France DocID: 1eDpx - View Document
	2003 Paper 4 Question 9 Computation Theory What is the Church–Turing Thesis? Briefly describe some evidence that it is true. [4 marks] Using the Church–Turing Thesis, or otherwise, show that if f (x) and g(x) are DocID: 1bJnn - View Document