Symposium on 75 Years of Turing Machine and Lambda-Calculus

Karlsruhe, Germany, October 20-21, 2011

The Institute of Cryptography and Security and the Institute of Theoretical Informatics of Karlsruhe Institute of Technology announce COMPUTING 2011, a symposium devoted to the 75th anniversary of two pioneering works on the theory of computation: ‘On Computable Numbers, with an Application to the Entscheidungsproblem’ by Alan Turing and ‘An Unsolvable Problem of Elementary Number Theory’ by Alonzo Church.
(For more information click here).

The symposium will review the work of Church and Turing and its influence on contemporary Theoretical Computer Science. Talks at the symposium are intended to cover—among others—topics like

  • Different Models of Computing (including, e.g., Parallel, Quantum, and Molecular/DNA Computing),
  • Complexity (including Computational and Parameterized Complexity),
  • Decidability of various Logical and Computational Systems,
  • Termination Analysis,
  • Computational Geometry.
The symposium will consist of invited talks given by both established and junior scientists.

COMPUTING 2011 will be co-located with Deduktionstreffen 2011. Registration for COMPUTING 2011 allows free access to Deduktionstreffen 2011.

Registration deadline is 17th of October, 2011.