[logic-ml] Computability and Complexity in Analysis 2013

-- 河村彰星 東京大学大学院情報理工学系研究科コンピュータ科学専攻 助教（今井研究室） 03-5841-4097 http://www-imai.is.s.u-tokyo.ac.jp/~kawamura/index_j.html First Call for Papers http://cca-net.de/cca2013/ The Tenth International Conference on Computability and Complexity in Analysis (CCA 2013) will take place in Nancy, France, July 8-11, 2013. The CCA 2013 Program Committee cordially invites researchers in the area of computability and complexity theory to submit papers for presentation at the conference. Topics: * Computable analysis * Complexity on real numbers * Constructive analysis * Domain theory and analysis * Theory of representations * Computable numbers, subsets and functions * Randomness and computable measure theory * Models of computability on real numbers * Realizability theory and analysis * Reverse analysis * Real number algorithms * Implementation of exact real number arithmetic Submissions: Authors are invited to submit a PDF version of an extended abstract (typically 10 pages) on the following web page: https://www.easychair.org/conferences/?conf=cca2013 Dates: Submission deadline: April 1, 2013 Notification of authors: May 6, 2013 Registration deadline: May 20, 2013 Final version: May 27, 2013 Invited Speakers: * Ulrich Berger (Swansea, UK) * Takayuki Kihara (JAIST, Japan) * Cristobal Rojas (Toronto, Canada) * Daniel Roy (Cambridge, UK) * Martin Ziegler (Darmstadt, Germany) Program Committee: * Andrej Bauer (Ljubljana, Slovenia) * Arno Pauly (Cambridge, UK) * Hannes Diener (Siegen, Germany) * Cameron Freer (MIT, USA) * Laurent Bienvenu (Paris, France) * Akitoshi Kawamura (Tokyo, Japan) * Ker-I Ko (Stony Brook, USA) * Matthias Schröder (Vienna, Austria) * Robert Rettinger (Hagen, Germany) * Ning Zhong (Cincinnati, USA), chair Local Organizers * Anne-Lise Charbonnier * Hugo Férée * Emmanuel Hainry * Mathieu Hoyrup (chair) * Emmanuel Jeandel * Romain Péchoux