TOP
Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminars
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Publishing
Within this website:
External resources:
dblp
Within this website:
External resources:
  • the dblp Computer Science Bibliography


Dagstuhl Seminar 99461

Computability and Complexity in Analysis

( Nov 14 – Nov 19, 1999 )

Permalink
Please use the following short url to reference this page: https://www.dagstuhl.de/99461

Organizers
  • A. Nerode (Ithaka)
  • K. Weihrauch (Hagen)
  • Ker-I Ko (Stony Brook)





Motivation

Already for a long time physicists, engineers, mathematicians and other scientists are spending large amounts of computing resources on computations over the real numbers. So far computer scientists deal mainly with computations over discrete, countable structures. But increasingly they too are confronted with problems involving real numbers and continuous structures (for example the complexity theoretic analysis of numerical problems, modeling of continuous or partially continuous signals and processes, hybrid systems, computation problems connected with dynamical systems, computational geometry). In order to deal with these problems one has to find effective analogues of results in classical analysis, to classify problems in the framework of computability theory, and to analyze their complexity. It also still requires a careful discussion of suitable models and work on the foundations of computability over the real numbers.

In this seminar the emphasis will be put on computable analysis which was initiated by Turing and Grzegorczyk and which is based on the Turing machine model.


Participants
  • A. Nerode (Ithaka)
  • K. Weihrauch (Hagen)
  • Ker-I Ko (Stony Brook)

Related Seminars
  • Dagstuhl Seminar 9717: Computability and Complexity in Analysis (1997-04-21 - 1997-04-25) (Details)
  • Dagstuhl Seminar 01461: Computability and Complexity in Analysis (2001-11-11 - 2001-11-16) (Details)