This special issue of the journal Logical Methods in Computer Science (LMCS) contains a number of selected articles related to the Ninth International Conference on Computability and Complexity in Analysis (CCA 2012) that took place from 24-27 June 2012 in Cambridge, UK, see http://cca-net.de/cca2012/. Most of these articles are based on papers that were presented at this conference. The conference and this special issue are concerned with computable analysis, the theory of computability and complexity over real-valued data. The contributions to this special issue cover several topics of current research including classical topics of computable analysis and constructive analysis, computable measure theory, algorithmic randomness and computational complexity. All articles in this special issue have been carefully refereed according to the usual high standards of the journal LMCS and our discipline.
We would like to thank all authors for their contributions to this special issue and all referees for their thorough and careful work. We would also like to use this opportunity to thank all members of the organizing committee of the conference CCA 2012 and all sponsors for their generous support. The help and support from LMCS is kindly acknowledged.
Martín Escardó, Arno Pauly, Matthias Schröder, Klaus Weihrauch
Special Issue Editors
|
Creative Commons