Computability and Complexity in Analysis

J.UCS Special Issue

This special issue of the Journal of Universal Computer Science (J.UCS) contains a selection of 12 articles in the area of Computability and Complexity in Analysis. Many, but not all of them were presented at the Sixth International Conference on Computability and Complexity in Analysis, CCA 2009, that took place on August 18 - 22, 2009 in Ljubljana, Slovenia. It was the 15th event in a series of workshops, seminars and conferences in this area. For more information about CCA see http://cca-net.de.

The conference and this special issue are concerned with Computable Analysis, the theory of computability and complexity over real-valued data. Computability theory studies the limitations and abilities of computers in principle. Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. In particular, Computable Analysis supplies an algorithmic foundation for numerical computation.

We thank all authors for their contributions and the referees for their thorough and diligent work. Finally, we thank the members of the organising committee of the conference at the University of Ljubljana for their help and Professor Hermann Maurer, the managing editor of J.UCS, for his support.