CiE 2012 - How the World Computes

Print current page  Print this page

First Call for Papers



Computability in Europe 2012: How the World Computes
University of Cambridge
Cambridge, 18-23 June 2012

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, economics and the wider scientific world.

Its central theme is the computability-theoretic concerns underlying the broad spectrum of Turing's interests, and the contemporary research areas founded upon and animated by them. In this sense, CiE 2012, held in Cambridge in the week running up to the centenary of Turing's birthday, deals with the essential core of what made Turing's contribution so influential and long-lasting.

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

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. There will also be post-conference publications, drawing on contributions presented at the conference.


  • Submission Deadline for LNCS:
  • Notification of authors:
  • Deadline for final revisions:
  • Submission Deadline for Informal Presentations:
  • Jan. 20, 2012
  • Mar. 16, 2012
  • Apr. 6, 2012
  • May 11, 2012
  • 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
  • The Turing Test and Thinking Machines
    Chairs: Mark Bishop and Rineke Verbrugge
  • Computational Models After Turing: The Church-Turing Thesis and Beyond
    Chairs: Martin Davis and Wilfried Sieg
  • Morphogenesis/Emergence as a Computability Theoretic Phenomenon
    Chairs: Philip Maini and Peter Sloot
  • Open Problems in the Philosophy of Information
    Chairs: Pieter Adriaans and Benedikt Loewe
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
  • Developments in Computational Models (DCM 2012), June 17, 2012
  • THE INCOMPUTABLE at Kavli Royal Society International Centre Chicheley Hall, June 12-15, 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
  • Information theory and computation
  • 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
  • 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.

Contributed papers will be selected from submissions received by the PROGRAMME COMMITTEE consisting of:

  • Samson Abramsky (Oxford)
  • Franz Baader (Dresden)
  • Mark Bishop (London)
  • Luca Cardelli (Cambridge)
  • S Barry Cooper (Leeds, Co-chair)
  • Anuj Dawar (Cambridge, Co-chair)
  • Bernold Fiedler (Berlin)
  • Martin Hyland (Cambridge)
  • Viv Kendon (Leeds)
  • Ming Li (Waterloo)
  • Angus MacIntyre (London)
  • Larry Moss (Bloomington)
  • Damian Niwinski (Warsaw)
  • Prakash Panangaden (Montreal)
  • Brigitte Pientka (Montreal)
  • Wilfried Sieg (Carnegie Mellon)
  • Bettina Speckmann (Eindhoven)
  • Peter van Emde Boas (Amsterdam)
  • Rineke Verbrugge (Groningen)
  • Pieter Adriaans (Amsterdam)
  • Arnold Beckmann (Swansea)
  • Paola Bonizzoni (Milan)
  • Douglas Cenzer (Gainesville)
  • Ann Copestake (Cambridge)
  • Solomon Feferman (Stanford)
  • Luciano Floridi (Hertfordshire)
  • Marcus Hutter (Canberra)
  • Stephan Kreutzer (Oxford)
  • Benedikt Loewe (Amsterdam)
  • Philip Maini (Oxford)
  • Amitabha Mukerjee (Kanpur)
  • Dag Normann (Oslo)
  • Jeff Paris (Manchester)
  • Helmut Schwichtenberg (Munich)
  • Mariya Soskova (Sofia)
  • Christof Teuscher (Portland)
  • Jan van Leeuwen (Utrecht)

The PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) in computability related areas to submit their papers (in PDF-format, max 10 pages) for presentation at CiE 2012. We particularly invite papers that build bridges between different parts of the research community.

The conference is sponsored by the ASL, EACSL, IFCoLog, King's College Cambridge, The University of Cambridge and Microsoft Research.

Contact: Anuj Dawar - anuj.dawar at cl.cam.ac.uk

The Alan Turing Year ASL Cambridge University Cambridge University Press Computability in Europe the source site ELsevier EACSL EATCS IET IFCoLog IOS Press Isaac Newton Institute King's College, Cambridge Microsoft Research Cambridge Science AAAS Springer

websites: Barry Cooper and Arnold Beckmann 2011-09-15 Valid HTML 4.01! Valid CSS!