University of Birmingham > Talks@bham > Postgraduate Seminars in the School of Computer Science > Infinite data structures, computability and decidability

## Infinite data structures, computability and decidabilityAdd to your list(s) Download to your calendar using vCal - Olaf Klinke, School of Computer Science
- Monday 26 October 2009, 14:00-15:00
- Room 124, School of Computer Science.
If you have a question about this talk, please contact Mohamed Menaa. I will try to convince the audience that topology, which is a field of mathematics arising from geometry, is useful in computer science when one does computing with infinite data structures such as streams of numbers, infinite trees and alike. In particular we discuss different methods of representing real numbers and relate them to geometric ideas. We show how geometric ideas translate quite naturally to issues about deciding properties of numbers such as ‘is the number positive?’ or ‘is the number equal to 0?’ or ‘can this function be implemented in some programming language?’ This talk is part of the Postgraduate Seminars in the School of Computer Science series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsBritGrav 15 Computer Science Departmental Series Lab Lunch## Other talksGeometry of alternating projections in metric spaces with bounded curvature TBC Test talk Modelling uncertainty in image analysis. Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Extending the Lax type operator for finite W-algebras |