[FOM] CiE 2013 in Milan, July: 3rd Call for Papers
CiE
martin at eipye.com
Fri Jan 18 21:34:32 EST 2013
3rd CALL FOR PAPERS:
************************************************************************
9th International Conference on COMPUTABILITY IN EUROPE
CiE 2013: The Nature of Computation
Milan, Italy
July 1 - 5, 2013
http://cie2013.disco.unimib.it
http://aspic.bio.disco.unimib.it/cie2013/cie2013.disco.unimib.it/
co-located with Unconventional Computation and Natural Computation 2013
http://ucnc2013.disco.unimib.it
IMPORTANT DATES
Submission Deadline for LNCS: 20 January 2013
Notification of authors: 4 March 2013
Deadline for final revisions: 1 April 2013
CiE 2013 is the ninth conference organised by CiE (Computability in
Europe), a European association of mathematicians, logicians, computer
scientists, philosophers, physicists and others interested in new
developments in computability and their underlying significance for the
real world. Previous meetings have taken place in Amsterdam (2005),
Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte
Dalgada (2010), Sofia (2011) and Cambridge (2012).
TOPICS
CiE 2013 conference topics include, but not exclusively:
* Admissible sets
* Algorithms
* Analog computation
* Artificial intelligence
* Automata theory
* Bioinformatics
* Classical computability and degree structures
* Cognitive science and modelling
* Complexity classes
* Computability theoretic aspects of programs
* Computable analysis and real computation
* Computable structures and models
* Computational and proof complexity
* Computational biology
* Computational creativity
* Computational learning and complexity
* Computational linguistics
* Concurrency and distributed computation
* Constructive mathematics
* Cryptographic complexity
* Decidability of theories
* Derandomization
* DNA computing
* Domain theory and computability
* Dynamical systems and computational models
* Effective descriptive set theory
* Emerging and Non-standard Models of Computation
* Finite model theory
* Formal aspects of program analysis
* Formal methods
* Foundations of computer science
* Games
* Generalized recursion theory
* History of computation
* Hybrid systems
* Higher type computability
* Hypercomputational models
* Infinite time Turing machines
* Kolmogorov complexity
* Lambda and combinatory calculi
* L-systems and membrane computation
* Machine learning
* Mathematical models of emergence
* Molecular computation
* Morphogenesis and developmental biology
* Multi-agent systems
* Natural Computation
* Neural nets and connectionist models
* Philosophy of science and computation
* Physics and computability
* Probabilistic systems
* Process algebras and concurrent systems
* Programming language semantics
* Proof mining and applications
* Proof theory and computability
* Proof complexity
* Quantum computing and complexity
* Randomness
* Reducibilities and relative computation
* Relativistic computation
* Reverse mathematics
* Semantics and logic of computation
* Swarm intelligence and self-organisation
* Type systems and type theory
* Uncertain Reasoning
* Weak systems of arithmetic and applications
We particularly welcome submissions in emergent areas, such as
bioinformatics and natural computation, where they have a basic
connection with computability.
SUBMISSIONS
Authors of accepted papers are expected to present their work at the
conference. Each presentation will be 25 minutes long, including the
time for the eventual discussion. 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.
Authors are required to submit their manuscripts electronically in PDF
using the LNCS style. Authors using LaTeX can download the needed macros
at Springer-Verlag site. Papers should not exceed 10 pages; full proofs
may appear in a clearly marked technical appendix which will be read at
the reviewers' discretion.
The submission process is managed by EasyChair and is available at
https://www.easychair.org/conferences/?conf=cie2013.
The proceedings will be available at the conference venue.
The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag.
AWARDS & GRANTS
Springer-Verlag has graciously funded two awards that will be given
during the CiE 2013 Conference.
Best student paper
This prize will be awarded for the best student paper presented at CiE
2013, as judged by the Program Committee. A prize of 500 Euros will be
given to the author(s) of the best student-authored paper (or split
between more than one paper if there is a tie). In order to be
considered, a paper has to be submitted in the category 'Regular paper
(eligible for best student paper award)' on
EasyChair. Papers are eligible if all of its
authors are full-time students at the
time of submission.
Best paper on Natural Computing
The prize consists of the four volumes of the Handbook of Natural
Computing (see http://cie2013.disco.unimib.it/awards/). This prize will
be awarded to the best paper on Natural Computing presented at CiE 2013,
as judged by the Program Committee. A paper is eligible if its main
topic falls within the scope of Natural Computing, roughly defined as
the set of fields studied in the above handbook. The Program Committee
is the only judge of the relevance of a paper within the Natural
Computing scope. The authors of a paper eligible for the award must
indicate this in the submission notes.
Grants
The ASL, EATCS and Elsevier have decided to sponsor students. In
particular Elsevier under the Women in Computability program offers
funds for junior female researchers to attend CiE 2013. The applications
for ASL and Elsevier funds must be sent before April 1, 2013.
Preference will be given to researchers who present a paper (contributed
paper or informal talk), see http://cie2013.disco.unimib.it/awards/ for
details.
INVITED SPEAKERS
Ulle Endriss (University of Amsterdam)
Lance Fortnow (Georgia Institute of Technology)
Anna Karlin (University of Washington)
Bernard Moret (Ecole Polytechnique Fédérale de Lausanne)
Mariya Soskova (Sofia University)
Endre Szemeredi (Hungarian Academy of Sciences,
Rutgers University) joint CIE/UCNC 2013 speaker
TUTORIAL SPEAKERS (joint with UCNC 2013)
Gilles Brassard (Universite de Montreal)
Grzegorz Rozenberg (Leiden Institute of Advanced
Computer Science and University of Colorado at Boulder)
SPECIAL SESSIONS on
Algorithmic Randomness
organizers: Mathieu Hoyrup, Andre Nies
Data Streams and Compression
organizers: Paolo Ferragina, Andrew
McGregor Computational Complexity in the Continuous World
organizers: Akitoshi Kawamura, Robert
Rettinger Computational Molecular Biology
organizers: Alessandra Carbone, Jens Stoye Computation in Nature
organizers: Mark Daley, Natasha Jonoska History of Computation
organizers: Gerard Alberts, Liesbeth De Mol
PROGRAM COMMITTEE:
* Gerard Alberts (Amsterdam) * Luis
Antunes (Porto) * Arnold Beckmann
(Swansea) * Laurent Bienvenu (Paris) *
Paola Bonizzoni (Milan, co-chair) * Vasco
Brattka (Munich and Cape Town, co-chair) *
Cameron Buckner (Houston TX) * Bruno
Codenotti (Pisa) * Stephen Cook (Toronto
ON) * Barry Cooper (Leeds) * Ann
Copestake (Cambridge) * Erzsebet
Csuhaj-Varju (Budapest) * Anuj Dawar
(Cambridge) * Gianluca Della Vedova
(Milan) * Liesbeth De Mol (Gent) * Jerome Durand-Lose (Orleans)
* Viv Kendon (Leeds) * Bjoern Kjos-Hanssen (Honolulu, HI)
* Antonina Kolokolova (St. John's NF) * Benedikt
Loewe (Amsterdam) * Giancarlo Mauri
(Milan) * Rolf Niedermeier (Berlin)
* Geoffrey Pullum (Edinburgh) * Nicole Schweikardt (Frankfurt)
* Sonja Smets (Amsterdam) * Susan
Stepney (York) * S. P. Suresh
(Chennai) * Peter van Emde Boas (Amsterdam)
Contact: Paola Bonizzoni - bonizzoni at disco.unimib.it
Website: http://cie2013.disco.unimib.it
__________________________________________________________________________
ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk
CiE Conference Series http://www.illc.uva.nl/CiE
CiE 2010 http://www.cie2010.uac.pt/
CiE Membership Application Form http://www.cs.swan.ac.uk/acie
__________________________________________________________________________
More information about the FOM
mailing list