Computability in Europe 2006
Logical Approaches to Computational Barriers

Print current page  Print this page

Regular Talk:
Infinite Time Turing Computation

Speaker: Barnaby Dawson
Slot: Sat, 14:30-14:50, Faraday D (col. 3)

Abstract

Infinite time Turing computation is a generalisation of Turing
computation to computers with infinite tapes and an infinite amount
of time to work on those tapes.  The implementation of such a
computer will be described and the implications of the assumption
that all sequences can be viewed as the output of such a computer
shall be elucidated.  In particular links with the axiom of choice
and the coninuum hypothesis will be shown.


websites: Arnold Beckmann 2006-04-28 Valid HTML 4.01! Valid CSS! eXTReMe Tracker hit counters by www.free-counters.net