This special issue of the journal Loical Methods in Computer Science (LMCS) contains a selection of 8 articles in the area of Computability and Complexity in Analysis. Many, but not all of them were presented at the Seventh International Conference on Computability and Complexity in Analysis (CCA 2010) that took place on June 21-25, 2010 in Zhenjiang, China. It was the 16th event in a series of workshops, seminars and conferences in this area. For more information about CCA see 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 Zhenjiang for their help and the people from LMCS for their support.