COMPUTER SCIENCE COLLOQUIUM

Σ-Definability and Computability on Continuous Data Types

Margarita Korovina BRICS University of Aarhus

Tuesday, May 6, 2003, at 14:15 IMADA's Seminar Room

ABSTRACT

It is well known that the classical theory of computation, which works with discrete structures, is not suitable for formalisation of computations that operate on real-valued data. Most computational problems in physics and engineering are of this type, e.g. problems relevant to the foundation of dynamical and hybrid systems. Since computational processes are discrete in their nature and objects we consider are continuous, formalisation of computability of such objects is already a challenging research problem.

In this talk we will report about a logical approach to computability on the reals based on the notion of definability. In this approach continuous objects and computational processes involving these objects can be defined using finite formulas in a suitable structure.

We will discuss beneficial features of this approach, recent results and future work.

Host: Klaus Meer

---

SDU HOME | IMADA HOME | Previous Page

---

Last modified: March 20, 2003.

Joan Boyar (joan@imada.sdu.dk)