Dagstuhl Seminar 9717
Computability and Complexity in Analysis
( Apr 21 – Apr 25, 1997 )
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/9717
Organizers
- A. Nerode (Cornell)
- K. Weihrauch (Hagen)
- Ker-I Ko (Stony Brook)
Contact
External Homepage
Impacts
- Computability and complexity in analysis - Nerode, Anil; Ko, Ker-I; Weihrauch, Klaus - Amsterdam : Elsevier, 1999 - (Theoretical computer science : 219. 1999, 1/2, S. 1-512).
- Special issue of selected papers from the Dagstuhl workshop on scheduling in computer and manufacturing systems - Blazewicz, Jacek; Coffman, Edward G.; Ecker, Klaus; Finke, Gerd - Chichester : Wiley, 2002. - (Journal of scheduling : 5. 2002, 6, S. 427-510)..
The seminar “Computability and Complexity in Analysis” was held in Dagstuhl from April 21 to 25, 1997. It was attended by 43 computer scientists, mathematicians and logicians who are interested in the diverse areas of computational analysis. The 33 talks presented here represented many different theories and approaches in this topic.
In the foundational study, they included constructive analysis (of E. Bishop), recursive analysis, type-2 theory of effectivity and the domaintheoretic approach. Classical theories on real-valued functions have been extended to more general functional spaces. Specific problems in computable analysis, such as the Riemann mapping theorem and problems in calculus of variations, have also been presented. In the complexity study, a number of talks were about the modifications and comparisons of three different models: Turing machine-based complexity theory, information-based complexity theory (IBC) and real RAM-based complexity theory (BSS). More practical issues, including interval analysis, automatic result verification, bounded-value problem, on-line computation and geometric and stochastic modelling, were also presented.
Creative Commons BY 3.0 Unported license
- A. Nerode (Cornell)
- K. Weihrauch (Hagen)
- Ker-I Ko (Stony Brook)
