DCM 2012: Developments in Computational Models

• Martin Escardo (Birmingham, United Kingdom): The intrinsic topology of the universe in intuitionistic type theory

• Arno Pauly (Cambridge, England) and Matthew de Brecht (Kyoto, Japan): Non-deterministic computation and the Jayne Rogers Theorem

• Aleks Kissinger (Oxford, England), Alex Merry (Oxford, England) and Matvey Soloviev (Cambridge, England): Pattern Graph Rewrite Systems

• Abeer Al-Humaimeedy (Riyadh, Saudi Arabia) and Maribel Fernandez (London, England): General Dynamic Recovery for Compensating CSP

• Sam Sanders (Gent, Belgium): Algorithm and Proof as Ω-invariance and Transfer: A new model of computation in Nonstandard Analysis

• Michael Gabbay (London, England): An explicit, and very simple, construction of a model of untyped λ-equality

• Luca Cardelli (Cambridge, United Kingdom): TBA

• Benedek Nagy (Debrecen, Hungary) and Sándor Vályi (Nyíregyháza, Hungary): Computing discrete logarithm by interval-valued paradigm

• Miklos Bartha (St. John's, Canada): Quantum Turing Automata

• Eugen Jiresch (Vienna, Austria): Towards a GPU-based Implementation of Interaction Nets

• Ed Blakey (Bristol, England): Ray Tracing Computing the Uncomputable?

• Elvira Mayordomo (Zaragoza, Spain): Fractal techniques in information theory