[FOM] [CiE] CiE Newsletter, December 2008 - late item

S B Cooper pmt6sbc at maths.leeds.ac.uk
Tue Dec 2 19:01:29 EST 2008

 From Jerome Durand-Lose:

Worshop New Worlds of Computation, Orleans, FRANCE, January 12, 2009

Worshop New Worlds of Computation (NWC '09)
/ Atelier Nouveaux Mondes du Calcul

January 12, 2009  /  12 janvier 2009
Orleans, FRANCE



Models of computation that fall out of the Turing context:

     * Analog computation
     * Continuous computation
     * Hybrid systems
     * Computation on infinite structures (Ordinals, linear orders)
     * Hypercomputation
     * Infinite time computation
     * Non-Euclidean spaces
     * Non-standard approaches
     * Optical collision
     * Abstract geometrical computation
     * Cellular automata
     * Collision based, quantum, DNA, membrane...

The classical Turing computability has been THE paradigm for
computation for more than half a century. In less than two decades,
various paradigms have been proposed (invented, discovered or
reframed) and communities have emerged: computable analysis, algebraic
models, Quantum computing, DNA, Cellular automaton... All of them fall
outside the classical context because they manipulate objects that are
just out of the classical scope (infinite objects or uncountably many
values) or continuous or infinite time. Unfortunately, there is no
miraculous generalized Church-Turing thesis (nor specialized analog

The workshop aims at gathering researchers of a scattered but wide
off-Turing community in order to share points of view and bring forth
the common problematics. The audience aimed at is roughly the same as:

     * Machines, Computations and Universality
     * Unconventional Computation
     * Computability in Europe
     * Hypercomputation Research Network


Propose a talk	December 22nd 2008
Abstract	January 5th 2009
Registration	January 5th 2009

Tentative program

     * Andrew Adamatzky
       Physarum computing
     * Florent Becker
       Self-Assembling tiles
     * Olivier BOURNEZ or Emmanuel HAINRY (?)
       Decidability in dynamical systems
     * Olivier CARTON
       Automata on infinite linear orders
     * Jerome DURAND-LOSE
       Abstract geometrical computation
     * Daniel S. GRACA
       Computability with continuous-time dynamical systems
     * Daniel KROB
       Non standard approach to computation
     * Sylvain PERIFEL
     * Maurice MARGENSTERN
       Computation in hyperbolic spaces
     * Simon PERDRIX
       Graph theory and quantum computing
     * Damien WOODS
       Optical computation


     * 1-2 page(s) abstract with references, 
local printing, distributed at the workshop, and
     * a special issue of International Journal 
of Unconventional Computing, open post-workshop submission.

Fares FREE

It includes: lunch, coffee break(s), proceedings.

We have a little money to help. Please contact us in advance.

Organisation and contact (for communication and participation)

Jérôme Durand-Lose contact: jerome.durand-lose at univ-orleans.fr

LIFO (Laboratoire d'Informatique Fondamentale 
d'Orleans), projet Graphes et Algorithmes 
Universite d'Orleans - logo Universite d'Orleans, 
Departement d'Informatique de l'UFR Sciences.

More information about the FOM mailing list