COMPUTABILITY IN EUROPE 2010: Programs, Proofs, Processes
Ponta Delgada (Azores), Portugal
June 30 to July 4, 2010
Deadline for submissions: 20 JANUARY 2010
Computability in Europe provides the largest international conference dealing with the full spectrum of computability-related research.
CiE 2010 in the Azores is the sixth conference of the Series, held in a geographically unique and dramatic location, Europe's most Westerly outpost. The theme of CiE 2010 - "Programs, Proofs, Processes" - points to the usual CiE synergy of Computer Science, Mathematics and Logic, with important computability-theoretic connections to science and the real universe.
TUTORIALS: Jeffrey Bub (Information, Computation and Physics), Bruno Codenotti (Computational Game Theory).
INVITED SPEAKERS: Eric Allender, Jose L. Balcazar, Shafi Goldwasser, Denis Hirschfeldt, Seth Lloyd, Sara Negri, Toniann Pitassi, and Ronald de Wolf.
SPECIAL SESSIONS on:
Organizers: Paola Bonizzoni, Krishna Narayanan
Invited speakers: Giancarlo Mauri, Natasha Jonoska, Stephane Vialette, Yasubumi Sakakibara
Organizers: Luis Antunes, Alan Selman
Invited speakers: Eric Allender, Christian Glasser, John Hitchcock, Rahul Santhanam
Computability of the Physical
Organizers: Barry Cooper, Cris Calude
Invited speakers: Giuseppe Longo, Yuri Manin, Cris Moore, David Wolpert
Proof Theory and Computation
Organizers: Martin Hyland, Fernando Ferreira
Invited speakers: Thorsten Altenkirch, Samuel Mimram, Paulo Oliva, Lutz Strassburger
Reasoning and Computation from Leibniz to Boole
Organizers: Benedikt Loewe, Guglielmo Tamburrini
Invited speakers: Volker Peckhaus, Olga Pombo, Sara Uckelman
Web Algorithms and Computation
Organizers: Martin Olsen, Thomas Erlebach
Confirmed speaker: Debora Donato, Hannah Bast
SPECIAL TRIBUTE TO MARIAN POUR-EL: Ning Zhong.
CiE serves as an interdisciplinary forum for research in all aspects of computability and foundations of computer science, as well as the interplay of these theoretical areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics.
Formal systems, attendant proofs, and the possibility of their computer generation and manipulation (for instance, into programs) have been changing a whole spectrum of disciplines. The conference will address not only the more established lines of research of Computational Complexity and the interplay between Proofs and Computation, but also novel views that rely on physical and biological processes and models to find new ways of tackling computations and improving their efficiency.
We particularly invite papers that build bridges between different parts of the research community. Since women are underrepresented in mathematics and computer science, we emphatically encourage submissions by female authors. The Elsevier Foundation is supporting the CiE conference series in the programme "Increasing representation of female researchers in the computability community". This programme will allow us to fund child-care support, a mentoring system for young female researchers, and also a small number of grants for junior female researchers (see below).
The dates around the submission process are as follows:
Submission Deadline: 20 January 2010
Notification to Authors: 18 March 2010
Deadline for Final Version: 8 April 2010
CiE 2010 conference topics include, but not exclusively:
- Admissible sets
- Analog computation
- Artificial intelligence
- Automata theory
- Classical computability and degree structures
- Computability theoretic aspects of programs
- Computable analysis and real computation
- Computable structures and models
- Computational and proof complexity
- Computational complexity
- Computational learning and complexity
- Concurrency and distributed computation
- Constructive mathematics
- Cryptographic complexity
- Decidability of theories
- Domain theory and computability
- Dynamical systems and computational models
- Effective descriptive set theory
- Finite model theory
- Formal aspects of program analysis
- Formal methods
- Foundations of computer science
- Generalized recursion theory
- History of Computing
- Hybrid systems
- Higher type computability
- Hypercomputational models
- Infinite time Turing machines
- Kolmogorov complexity
- Lambda and combinatory calculi
- L-systems and membrane computation
- Mathematical models of emergence
- Molecular computation
- Natural computing
- Neural nets and connectionist models
- Philosophy of science and computation
- Physics and computability
- Probabilistic systems
- Process algebra
- Programming language semantics
- Proof mining
- Proof theory and computability
- Quantum computing and complexity
- Reducibilities and relative computation
- Relativistic computation
- Reverse mathematics
- Swarm intelligence
- Type systems and type theory
- Uncertain reasoning
- Weak arithmetics and applications
Contributed papers will be selected from submissions received by the
PROGRAMME COMMITTEE consisting of:
Klaus Ambos-Spies (Heidelberg), Luis Antunes (Porto), Arnold Beckmann (Swansea), Paola Bonizzoni (Milano), Alessandra Carbone (Paris), Steve Cook (Toronto ON), Barry Cooper (Leeds), Erzsebet Csuhaj-Varju (Budapest), Fernando Ferreira (Lisbon, co-chair), Nicola Galesi (Rome), Luis Mendes Gomes (Ponta Delgada), Rosalie Iemhoff (Utrecht), Achim Jung (Birmingham), Michael Kaminski (Haifa), Jarkko Kari (Turku), Viv Kendon (Leeds), James Ladyman (Bristol), Kamal Lodaya (Chennai), Giuseppe Longo (Paris), Benedikt Loewe (Amsterdam), Elvira Mayordomo (Zaragoza, co-chair), Wolfgang Merkle (Heidelberg), Russell Miller (New York NY), Dag Normann (Oslo), Isabel Oitavem (Lisbon), João Rasga (Lisbon), Nicole Schweikardt (Frankfurt), Alan Selman (Buffalo NY), Peter van Emde Boas (Amsterdam), Albert Visser (Utrecht)
The Programme Committee cordially invites all researchers in the area of the conference to submit their papers (in PDF-format, at most 10 pages) for presentation at CiE 2010.
The best of the accepted papers will be published in the conference proceedings within the Lecture Notes in Computer Science (LNCS) series of Springer, which will be available at the conference. Authors of accepted papers are expected to present their work at the conference. Submitted papers must describe work not previously published, and they must neither be accepted nor under review at a journal or at another conference with refereed proceedings.
All papers need to be prepared in LNCS-style LaTeX. Papers must not exceed 10 pages. Full proofs may appear in a technical appendix which will be read at the reviewers' discretion. Submissions authored or co-authored by members of the Programme Committee are not allowed.
Papers that have only student authors are eligible for the "CiE 2010 Best Student Paper Award." If your submission satisfies the requirements, please submit your paper in the category "Regular paper (eligible for Best Student Paper Award)." The Programme Committee will select the best submission among these after acceptance. The recipient of the Best Student Paper Award will get a fee waiver of the registration fee, a certificate, and a small symbolic cash prize.
Funded by the Elsevier Foundation's programme 'Women in Computability' we shall offer five travel grants (covering registration fee and up to 300 EUR in reimbursement for travel and accomodation expenses) for junior female researchers. More information will become available in March 2010.
Funded by the Elsevier journal Annals of Pure and Applied Logic (APAL), the organizers are offering a number of travel grants (including fee waivers and a modest reimbursement of travel and accommodation expenses) for students to attend CiE 2010. Student authors of accepted papers will have priority for these grants.
The Association for Symbolic Logic (ASL) sponsors modest student member travel grants. See here
New funding opportunities are expected to be offered. For more details concerning funding and up to date information, please consult regularly the web page of the conference