University of Birmingham > Talks@bham > Artificial Intelligence and Natural Computation seminars > The Church-Turing Thesis in the theory of computation

The Church-Turing Thesis in the theory of computation

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Lars Kunze.

This talk is part of the "AI and Consciousness" workshop

Abstract: At one level, the Church-Turing Thesis (CTT) is a quite clear and simple statement: All formalisations of the intuitive notion of computability are equally expressive. However, one might want to analyse this a bit more carefully, and also consider the context in which computation takes place. For example, we can consider machines that are connected to other machines, or machines that have a built-in notion of data type. Perhaps surprisingly, in these more refined settings the CTT is no longer valid, in the sense that otherwise perfectly natural computational formalisms are weaker than what one might like to call computable.

Speaker’s homepage: http://www.cs.bham.ac.uk/~axj

Host: Prof. John Barnden

This talk is part of the Artificial Intelligence and Natural Computation seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.