BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Postgraduate Seminars in the School of Computer Sc
ience
SUMMARY:Infinite data structures\, computability and decid
ability - Olaf Klinke\, School of Computer Science
DTSTART:20091026T140000Z
DTEND:20091026T150000Z
UID:TALK178AT
URL:/talk/index/178
DESCRIPTION: I will try to convince the audience that topology
\, which is a field of mathematics arising from ge
ometry\, is useful in computer science when one do
es computing with infinite data structures such as
streams of numbers\, infinite trees and alike.\n\
nIn particular we discuss different methods of rep
resenting real numbers and relate them to geometri
c ideas. We show how geometric ideas translate qui
te naturally to issues about deciding properties o
f numbers such as 'is the number positive?' or 'is
the number equal to 0?' or 'can this function be
implemented in some programming language?'
LOCATION:Room 124\, School of Computer Science
CONTACT:Mohamed Menaa
END:VEVENT
END:VCALENDAR