From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@sympa.inria.fr Delivered-To: caml-list@sympa.inria.fr Received: from mail3-relais-sop.national.inria.fr (mail3-relais-sop.national.inria.fr [192.134.164.104]) by sympa.inria.fr (Postfix) with ESMTPS id 7F1B77EE51 for ; Fri, 26 Apr 2013 00:51:59 +0200 (CEST) Received-SPF: None (mail3-smtp-sop.national.inria.fr: no sender authenticity information available from domain of pmt6sbc@maths.leeds.ac.uk) identity=pra; client-ip=129.11.36.1; receiver=mail3-smtp-sop.national.inria.fr; envelope-from="pmt6sbc@maths.leeds.ac.uk"; x-sender="pmt6sbc@maths.leeds.ac.uk"; x-conformance=sidf_compatible Received-SPF: None (mail3-smtp-sop.national.inria.fr: no sender authenticity information available from domain of pmt6sbc@maths.leeds.ac.uk) identity=mailfrom; client-ip=129.11.36.1; receiver=mail3-smtp-sop.national.inria.fr; envelope-from="pmt6sbc@maths.leeds.ac.uk"; x-sender="pmt6sbc@maths.leeds.ac.uk"; x-conformance=sidf_compatible Received-SPF: None (mail3-smtp-sop.national.inria.fr: no sender authenticity information available from domain of postmaster@amsta.leeds.ac.uk) identity=helo; client-ip=129.11.36.1; receiver=mail3-smtp-sop.national.inria.fr; envelope-from="pmt6sbc@maths.leeds.ac.uk"; x-sender="postmaster@amsta.leeds.ac.uk"; x-conformance=sidf_compatible X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: ApABAFCyeVGBCyQBkWdsb2JhbABRgzysTpJoFg4BAQEBCQsLBxQFI4IhIkkCBUg0YYgUDJ5OmAmHf5IpYQOXHEhdkww7 X-IPAS-Result: ApABAFCyeVGBCyQBkWdsb2JhbABRgzysTpJoFg4BAQEBCQsLBxQFI4IhIkkCBUg0YYgUDJ5OmAmHf5IpYQOXHEhdkww7 X-IronPort-AV: E=Sophos;i="4.87,553,1363129200"; d="scan'208";a="12259102" Received: from amsta.leeds.ac.uk ([129.11.36.1]) by mail3-smtp-sop.national.inria.fr with ESMTP; 26 Apr 2013 00:51:58 +0200 Received: from maths.leeds.ac.uk (localhost [127.0.0.1]) by amsta.leeds.ac.uk (8.14.1/8.14.1) with ESMTP id r3PMptnI003453 for ; Thu, 25 Apr 2013 23:51:58 +0100 (BST) Received: (from pmt6sbc@localhost) by maths.leeds.ac.uk (8.14.1/8.13.4/Submit) id r3PMp2OF001913 for caml-list@inria.fr; Thu, 25 Apr 2013 23:51:02 +0100 (BST) Date: Thu, 25 Apr 2013 23:51:02 +0100 (BST) From: S B Cooper Message-Id: <201304252251.r3PMp2OF001913@maths.leeds.ac.uk> To: caml-list@inria.fr X-Validation-by: pmt6sbc@maths.leeds.ac.uk Subject: [Caml-list] CiE 2013 - 2nd Call for Informal Presentations ********************************************************************** 2nd CALL FOR INFORMAL PRESENTATIONS - DEADLINE MAY 31th, 2013: -------------------------------------------------------------------------- COMPUTABILITY IN EUROPE 2013: The Nature of Computation Milan, Italy July 1 - 5, 2013 http://cie2013.disco.unimib.it co-located with Unconventional Computation and Natural Computation 2013 http://ucnc2013.disco.unimib.it -------------------------------------------------------------------------- CALL FOR INFORMAL PRESENTATIONS TUTORIAL SPEAKERS: Gilles Brassard (Universite de Montreal) and Grzegorz Rozenberg (Leiden Institute of Advanced Computer Science and University of Colorado at Boulder) PLENARY TALKS: Ulle Endriss (University of Amsterdam) Lance Fortnow (Georgia Institute of Technology) Anna Karlin (University of Washington) Bernard Moret (Ecole Polytechnique Federale de Lausanne) Mariya Soskova (Sofia University) Endre Szemeredi (Hungarian Academy of Sciences, Rutgers University For submission details, see: http://cie2013.disco.unimib.it/call-for-informal-presentations/ SUBMISSION DEADLINE for Informal Presentations: MAY 31, 2013 Authors will be notified of acceptance, usually within one week of submission. ****Authors of abstracts accepted for presentation are invited to submit a paper extending the abstract to the journal Computability. **** 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. SPECIAL SESSIONS: *Algorithmic Randomness (organizers: Mathieu Hoyrup, Andre Nies) Speakers: Johanna Franklin (University of Connecticut, USA), Noam Greenberg (Victoria University, New Zealand), Joseph S. Miller (University of Wisconsin, USA), Nikolay Vereshchagin (Moscow State University, Russia) * Computational Complexity in the Continuous World (organizers: Akitoshi Kawamura, Robert Rettinger) Speakers: Mark Braverman (Princeton University, USA), Daniel S. Graca (Universidade do Algarve), Joris van der Hoeven (Ecole polytechnique, France), Chee K. Yap (New York University, USA) * Computational Molecular Biology (organizers: Alessandra Carbone, Jens Stoye) Speakers: Sebastian Boecker (University of Jena, Germany), Marilia D. V. Braga (Inmetro, Brazil), Andrea Pagnani (Human Genetics Foundation, Italy), Laxmi Parida (IBM Thomas J. Watson Research Center, USA) * Computation in Nature (organizers: Mark Daley, Natasha Jonoska) Speakers: Jerome Durand-Lose (Univ. of Orleans, France), Giuditta Franco (Univ. of Verona Italy), Lila Kari (Univ. of Western Ontario, Canada), Darko Stefanovic (Univ. of New Mexico, USA) * Data Streams and Compression (organizers: Paolo Ferragina, Andrew McGregor) Speakers: Graham Cormode (AT&T Labs, USA), Irene Finocchi (University of Rome, Italy), Andrew McGregor (University of Massachusetts, USA), Marinella Sciortino (University of Palermo, Italy). * History of Computation (organizers: Gerard Alberts, Liesbeth De Mol) Speakers: David Alan Grier (George Washington University, USA), Thomas Haigh (University of Wisconsin, USA), Ulf Hashagen (Deutsches Museum, Germany), Matti Tedre (Stockholm University, Sweden). Contact: Paola Bonizzoni - bonizzoni@disco.unimib.it **********************************************************************