CFP: Computability in Europe 2012: How the World Computes

CiE 2012 is one of a series of special events, running throughout the Alan Turing Year, celebrating Turing's unique impact on mathematics, computing, computer science, informatics, morphogenesis, artificial intelligence, philosophy and computational aspects of physics, biology, linguistics, connectionist models, economics and the wider scientific world.

CiE 2012 is planned to be an event worthy of the remarkable scientific career it commemorates.

Plenary speakers include:
Andrew Hodges (Oxford, Special Invited Lecture), Ian Stewart (Warwick, Special Public Lecture), Dorit Aharonov (Jerusalem), Veronica Becher (Buenos Aires), Lenore Blum (Carnegie Mellon), Rodney Downey (Wellington), Yuri Gurevich (Microsoft), Juris Hartmanis (Cornell), Richard Jozsa (Cambridge), Stuart Kauffman (Vermont/ Santa Fe), James Murray (Washington/ Oxford, Microsoft Research Lecture), Stuart Shieber (Harvard), Paul Smolensky (Johns Hopkins) and Leslie Valiant (Harvard, jointly organised lecture with King's College).

SUBMISSION OF PAPERS and informal presentations are now invited for this historic event.

For submission details, see:
http://www.mathcomp.leeds.ac.uk/turing2012/WScie12/give-page.php?12

The conference proceedings will be published by LNCS, Springer-Verlag. Post-conference publications include special issues of APAL and LMCS. We encourage all researchers presenting papers of the highest research quality at CiE 2012 to submit their full papers to the CiE journal COMPUTABILITY where they will be handled as regular submissions.

 Submission Deadline for Informal Presentations: May 11, 2012

CiE 2012 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.

CiE 2012 will have a special relationship to the scientific legacy of Alan Turing, reflected in the broad theme: How the World Computes, with all its different layers of meaning. Contributions which are directly related to the visionary and seminal work of Turing will be particularly welcome.

Special sessions include

* The Universal Turing Machine, and History of the Computer
Chairs: Jack Copeland and John Tucker

* Cryptography, Complexity, and Randomness
Chairs: Rod Downey and Jack Lutz
Speakers so far: Eric Allender, Lance Fortnow, Omer Reingold, Alexander Shen

* The Turing Test and Thinking Machines
Chairs: Mark Bishop and Rineke Verbrugge
Speakers: Bruce Edmonds, John Preston, Susan Sterrett, Kevin Warwick, Jiri Wiedermann

* Computational Models After Turing: The Church-Turing Thesis and Beyond
Chairs: Martin Davis and Wilfried Sieg
Speakers: Giuseppe Longo, Peter Nemeti, Stewart Shapiro (tbc), Matthew Szudzik, Philip Welch, Michiel van Lambalgen

* Morphogenesis/Emergence as a Computability Theoretic Phenomenon
Chairs: Philip Maini and Peter Sloot
Speakers: Jaap Kaandorp, Shigeru Kondo, Nick Monk, John Reinitz, James Sharpe, Jonathan Sherratt

* Open Problems in the Philosophy of Information
Chairs: Pieter Adriaans and Benedikt Loewe
Speakers: Patrick Allo, Luis Antunes, Mark Finlayson, Amos Golan, Ruth Millikan

Information of funding for students (including ASL grants) and the attendance of female researchers is to follow. There will be the annual Women in Computability Workshop, supported by a grant from the Elsevier Foundation.

CiE 2012 will be associated/co-located with a number of other Turing centenary events, including:

* ACE 2012, June 15-16, 2012

* Computability and Complexity in Analysis (CCA 2012), June 24-27, 2012  http://cca-net.de/cca2012/

* Developments in Computational Models (DCM 2012), June 17, 2012  http://www.math.uni-hamburg.de/home/loewe/DCM2012/

* THE INCOMPUTABLE at Kavli Royal Society International Centre  Chicheley Hall, June 12-15, 2012  http://www.mathcomp.leeds.ac.uk/turing2012/inc/

Contact: Anuj Dawar - [email protected]