[FOM] CiE Newsletter No.53, December 28, 2011

Olivier Bournez bournez at lix.polytechnique.fr
Wed Dec 28 19:08:26 EST 2011

CiE Newsletter No.53, December 28, 2011:

Please send any items you would like included in 
next letter to Olivier Bournez (bournez at lix.polytechnique.fr)
DEADLINE: January 15th 2012.


For the latest news on the ALAN TURING YEAR, 
please go to http://www.mathcomp.leeds.ac.uk/turing2012/

** COMPUTABILITY - The Journal of the Association 
CiE. Now accepting submissions.

** TURING CENTENARY CONFERENCE http://www.cie2012.eu
Computability in Europe 2012: How the World 
Computes University of Cambridge Cambridge, 18-23 June 2012



1) Interdisciplinary Symposium on Complex 
Systems, Kos, Greece, September 19-25, 2012.
2) Bristol Quantum algorithms day
3) CCA 2012, Call for Papers
4) 2nd CfP: CiE 2012, Cambridge (U.K.), 18-23 June 2012
6) Complexity School @LI2012 : call for participation
7) CFP ACA 2012
8) Special issue of Information and Computation on ICC/DICE
9) LICS 2012 Call for Papers
10) "The Mathematical Legacy of Alan Turing" 
(Spitalfields Day), Cambridge (U.K.), 9 January 2012
11) CFP IJ Unconv. Comp.  spc is. on  New Worlds of Computation
12) Symposium on the History and Philosophy of 
Programming, Birmingham (U.K.), July 2012
15) Workshop on Turing's Legacy in Mathematics 
and Computer Science, BMC 2012, Canterbury, Kent, 16-19 April 2012
16) Seventh International Conference on 
Computability, Complexity and Randomness (CCR 2012)
17) Estonian Winter School in Comput Sci 2012, call for participation
18) 4th Automata, Theory and Applications Workshop Message
19) Congress for Alan Turing's Centenary: "Per il 
centenario di Alan Turing, fondatore 
dell'informatica." Roma, Acc. Naz. dei Lincei, Palazzo Corsini.
21) "Natural/Unconventional Computing and its 
philosophical significance", Birmingham (U.K.), 2-3 July 2012
22) BCTCS: British Colloquium for Theoretical 
Computer Science, Manchester (U.K.), 2-5 April 2012


1) Interdisciplinary Symposium on Complex 
Systems, Kos, Greece, September 19-25, 2012.

(From Hector Zenil)

Call For Papers

*Interdisciplinary Symposium on Complex Systems* Kos, Greece, September
19-25, 2012.
as part of The International Congress on Numerical Analysis and
Applied Mathematics (ICNAAM)

The main aim of the Interdisciplinary Symposium on Complex Systems is
to bring together researchers  working on complex systems. We invite
scientists, researchers,
engineers, and students to submit papers or attend.

The symposium theme this year is "Computation and Complexity in
Nature". All works covering the main theme and presented in the
following topics are welcome.

Symposium Topics (not limited to):

  -   Modeling complex systems
  -   Complex and adaptive dynamical systems
  -   Evolution of complexity
  -   Self-organized systems
  -   Complexity measurement
  -   Complexity and information theory
  -   (Random) Boolean networks
  -   Cellular automata
  -   Controlling complexity
  -   Chaotic dynamical systems
  -   Determinism behind thermodynamics and anti-thermodynamics
  -   Synchronization and information in dynamical networks
  -   Chaos control
  -   Quantum dynamics
  -   Quantum chaos
  -   Complex dynamics in biological systems
  -   Molecular dynamics simulations
  -   Complex adaptive human systems
  -   Natural selection and Darwinian Dynamics

(last year Symposium website is

Accepted extended abstracts are going to be published in American
Institute of Physics (AIP) Conference Proceedings and full papers will
be published in a specialized peer-reviewed journal to be announced.

This year, we are associating the event to the Turing Year to
celebrate Turing's achievements and interests in computation and
complexity in their broadest senses in Greece.


2) Bristol Quantum algorithms day

Dear all,

The university of Bristol is hosting the 2nd 
Heilbronn Quantum algorithms day that will take 
place on the 1st of February 2012. Following on 
from the success of last year’s event, the aim of 
the colloquium is to showcase recent research in 
quantum algorithms. We will have five excellent speakers:
·         Scott Aaronson (MIT)
·         Matty Hoban (Oxford)
·         Ashley Montanaro (University of Cambridge)
·         Martin Roetteler (NEC labs, Princeton)
·         Miklos Santha (LIAFA, Paris)
There is no conference fee but we ask people to 
register if they would like to come. We may be 
able to offer travel support to UK based PhD 
students who are unable to find funding from their home institutions.

Please see the meeting website for more details.

3) CCA 2012, Call for Papers

First Call for Papers and Announcement

     Nineth International Conference on
    Computability and Complexity in Analysis (CCA 2012)

           June 24 - 27, 2012, Cambridge, UK

Submission deadline: April 1, 2012

The conference takes place immediately after the

    *Centenary of Alan Turing's birth on 23 June 2012 and following the
    *Turing Centenary Conference CiE 2012 from 18-23 June 2012.

Invited Speakers:
    Vasco Brattka (Cape Town, South Africa)
    Akitoshi Kawamura (Tokyo, Japan)
    Robert Lubarsky (Boca Raton, FL, US)
    Elvira Mayordomo (Zaragoza, Spain)
    Andre Nies (Auckland, New Zealand)
    Lawrence C. Paulson (Cambridge, UK)
    Helmut Schwichtenberg (Munich, Germany)

Scientific Program Committee:
    Rod Downey (Wellington, New Zealand)
    Martín Escardó (Birmingham, UK)
    Guido Gherardi (Bologna, Italy)
    Jack H. Lutz (Ames, USA)
    Peter Schuster (Leeds, UK)
    Victor Selivanov (Novosibirsk, Russia)
    Klaus Weihrauch, chair (Hagen, Germany)
    Ning Zhong (Cincinnati, USA)

Organizing Committee:
    Anuj Dawar (Cambridge, UK)
    Martín Escardó (Birmingham, UK)
    Bjarki Holm (Cambridge, UK)
    Arno Pauly, chair (Cambridge, UK)

Authors of contributed papers are invited to submit a PDF version of an
extended abstract (typically 10-12 pages) on the following web page:


No proceedings will be published before the conference. A booklet with
abstracts will be made available at the conference. It is planned to
publish post-conference proceedings in a special issue of some journal

Submission deadline:             April 1, 2012
Notification of authors:        May 6, 2012
Final version of abstract:      May 27, 2012

Conference Web Page: http://cca-net.de/cca2012/

4) 2nd CfP: CiE 2012, Cambridge (U.K.), 18-23 June 2012



        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.

CiE 2012 is planned 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:

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 LNCS:                    Jan. 20, 2012
Notification of authors:                         Mar. 16, 2012
Deadline for final revisions:                    Apr. 6, 2012
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.


* 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

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

* 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

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

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

Contributed papers will be selected from submissions received by the

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

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

ORGANISING COMMITTEE: Arnold Beckmann (Swansea), Luca Cardelli
(Cambridge), S Barry Cooper (Leeds), Ann Copestake (Cambridge),
Anuj Dawar (Cambridge, Chair), Bjarki Holm (Cambridge),
Martin Hyland (Cambridge), Benedikt Loewe (Amsterdam),
Arno Pauly (Cambridge), Andrew Pitts (Cambridge)

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

For a small poster to download and display:

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


First Call for Papers
Santorini Island, Greece, September 24-27, 2012

Cellular automata (CA) present a very powerful 
approach to the study of spatio-temporal systems 
where complex phenomena build up out of many 
simple local interactions. They account often for 
real phenomena or solutions of problems, whose 
high complexity could unlikely be formalised in 
different contexts. Furthermore parallelism and 
locality features of CA allow a straightforward 
and extremely easy parallelisation, therefore an 
immediate implementation on parallel computing 
resources. These characteristics of the CA 
research resulted in the formation of 
interdisciplinary research teams. These teams 
produce remarkable research results and attract 
scientists from different fields. The main goal 
of the 10th edition of ACRI 2012 Conference 
(Cellular Automata for Research and Industry) is 
to offer both scientists and engineers in 
academies and industries an opportunity to 
express and discuss their views on current 
trends, challenges, and state-of-the art 
solutions to various problems in the fields of 
arts, biology, chemistry, communication, cultural 
heritage, ecology, economy, geology, engineering, 
medicine, physics, sociology, traffic control, etc.
Topics of either theoretical or applied interest 
about CA and CA-based models and systems include but are not limited to:
-	Algebraic properties and generalization
-	Complex systems
-	Computational complexity
-	Dynamical systems
-	Hardware circuits, architectures, systems and applications
-	Modeling of biological systems
-	Modeling of physical or chemical systems
-	Modeling of ecological and environmental systems
-	Image Processing and pattern recognition
-	Natural Computing
-	Quantum Cellular Automata
-	Parallelism

Authors are invited to submit papers presenting 
their original and unpublished research. Papers 
should not exceed 10 pages and should be 
formatted according to the usual LNCS article 
style (http://www.springer.com/computer/lncs). 
Details on the electronic submission procedure 
will be provided through the website of the 
conference (http://acri2012.duth.gr/).

A volume of proceedings will be published by 
Springer-Verlag in the Lecture Notes in Computer 
Science series and will be available by the time 
of the conference. After the conference, refereed 
volumes of selected proceedings containing 
extended papers will be organized as special 
issues of ISI international journals like Journal of Cellular Automata.

Paper submission: March 19, 2012
Notification of paper acceptance or rejection: April 15, 2012
Final version of the paper for the proceedings: May 14, 2012
Conference: September 24-27, 2012

ACRI2012 will be held at Petros M. Nomikos 
Conference Centre, Santorini Island, Greece.
Santorini, in an ancient island that endured one 
of the largest volcanic eruptions in history, 
feels definetely like no other place on earth. In 
Santorini, 120 miles southwest of mainland 
Greece, everything is brighter: the whitewashed 
cube-shaped houses, the lapis lazuli sea and the 
sunsets that light up the caldera. Recently, was 
elected by BBC Travel as the best island in the 
world, while Travel & Leisure magazine ranked 
Santorini in the first place in the list of 
World's Top Islands for the year 2011. Santorini 
as such a very popular touristic destination is 
served by multiple connections via both air and sea.

URL: http://acri2012.duth.gr
Contact: acri2012 at duth.gr

Georgios Sirakoulis (Democritus University of Thrace - Greece)
Stefania Bandini (University of Milano-Bicocca - Italy)

Steering Committee
Stefania Bandini (University of Milano-Bicocca - Italy)
Bastien Chopard (University of Geneva - Switzerland)
Giancarlo Mauri (University of Milano-Bicocca - Italy)
Hiroshi Umeo (University of Osaka Electro-Communication - Japan)
Thomas Worsch (University of Karlsruhe - Germany)

6) Complexity School @LI2012 : call for participation


              CIRM, MARSEILLE

          30 JANUARY- 3 FEBRUARY


The "Logic and interactions 2012" session will gather researchers in
various fields of "logic in computer science". The meeting will run five
consecutive weeks, from 30 January to 2 March 2012, each dedicated to
a particular area of logic and its interactions.

Each week will include lectures, invited talks and contributed talks,
together with work sessions. Lectures are aimed primarily at PhD
students and non-specialist researchers.


**NEW [04/12/2011]**: a preliminary programme is available from the web page.


This is a call for  abstracts   for contributed talks in the week.

Abstract and title must be submitted electronically to the three
patrick.baillot at ens-lyon.fr, 
nadia.creignou at lif.univ-mrs.fr, jean-yves.marion at loria.f

Submissions of abstracts on published work are allowed.

Abstract submission:                  December, 15th 2011
Registration:                         December 
19th  2011 (After this date, we cannot guarantee accommodation)
Notification for abstracts submitted:  January, 3rd, 2012


The theme of this week is the logical approach to 
logical complexity. The last decade has seen the 
development of logical formalisms derived from 
linear logic that characterize functions 
computable in various complexity classes 
(polynomial or elementary in time, logarithmic in 
space) in an implicit way, that is to say by 
contruction of the languages instead of using 
explicit measures. The theory that underlies 
these formalisms naturally meets the more 
established tradition of studying the complexity 
of algorithmic problems from logic 
(satisfiability, constraints solving, etc). The 
goal of this week is to survey the various 
aspects of the theory of algorithmic complexity 
where these communities meet, so as to trigger 
new interactions and enrich the various approaches.

   * Martin Hofmann (LMU, Munich, Germany): Pure 
pointer programs (implicit computational 
complexity with an abstract datatype of pointers)
   * Yiannis N. Moschovakis (UCLA, USA): Relative 
complexity in arithmetic and algebra
   * Stefan Szeider (TU Wien, Austria): Parameterized complexity
   * Heribert Vollmer (Leibniz Universität, 
Hannover, Germany): Circuit complexity

  * Emmanuel Hainry (Nancy): Computable Analysis: 
Computability and complexity over the reals
  * Neil Jones (Copenhagen): Alan Turing and 75 
years of Research in Models of Computation
  * Virgile Mogbil (Paris 13) : Parallel computation with Boolean proof nets

The morning sessions will consist in tutorials 
given by invited speakers while the afternoons 
will be devoted to shorter presentations and contributed talks.
Participants are welcome to submit a contribution 
(see the procedure above), but this is not mandatory.


There are no registration fees. Accomodation at the CIRM should be
available for all participants: the only condition is to register on

Pre-registration is now open on the web site.
Once your pre-registration is validated, you will be contacted by the
CIRM for the actual registration and booking.


Accommodation at the CIRM is funded for all participants requiring it:
simply select the appropriate option in the pre-registration form.
FYI: The standard rate for staying at the CIRM, including breakfast
and two meals each day is 82 (double room) to 90 (single room) euros
per day.

We might also provide a limited amount of travel grants for students.
To apply for such a grant, be sure to check the corresponding box of
the pre-registration form: we will contact you directly for further


* Patrick Baillot (LIP, ENS Lyon)
* Nadia Creignou (LIF, Marseille)
* Jean-Yves Marion (LORIA, Nancy)

7) CFP ACA 2012


First Call for Papers
ACA 2012
at 10th International Conference on Cellular 
Automata for Research and Industry (ACRI 2012)
Santorini Island, Greece, September 24-27, 2012



Cellular Automata are a well-known formal tool 
for modeling complex systems; they are found in 
many scientific fields and industrial 
applications. Synchronicity is one of the main 
features of Cellular Automata evolutions. Indeed, 
in the most common Cellular Automata framework, 
all cells are updated simultaneously at each discrete time step.

Recent trends consider the modeling of 
asynchronous systems based on local interactions. 
The aim of this workshop is to bring together 
researchers dealing with the theme of the 
asyncronicity inside Cellular Automata and other 
Discrete Models such as discrete Multi-Agents 
Systems, Boolean Networks, and so on, in order to 
foster their interaction and to provide a forum 
for presenting new ideas and works in progress on the subject.

Topics include, but are not limited to the 
following aspects of Asynchronous Cellular 
Automata and Asynchronous Discrete Models (such 
as Multi-Agents Systems, Boolean Networks and so on):

- dynamics
- complexity issues
- computational issues
- emergent properties
- models of parallelism and distributed systems
- models of phenomena from biology, chemistry, 
physics, engineering and other fields

Contributions of both theoretical and applicative interest are welcome.


Authors are invited to submit papers according to 
two contribution categories -- full and short 
papers -- meant to provide a differentiation of 
the papers in terms of their length, depth and/or
maturity. Papers must comply with the 
Springer-Verlag format and the maximum length of 
5 and 10 pages for short and full contributions, respectively.
Details on the electronic submission procedure 
will be provided through the website http://acri2012.duth.gr/.

Accepted papers will be published by 
Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series

It is also planned that selected papers will be 
considered for publication in Special issues of 
an international journal. They will contain 
refereed extended versions of selected papers presented at ACA workshop.


Paper submission: March 19, 2012
Notification of paper acceptance or rejection: April 15, 2012
Final version of the paper for the proceedings: May 14, 2012


Bastien Chopard (University of Geneva, Switzerland)
Alberto Dennunzio (Universita' di Milano - Bicocca, Italy) co-chair
Nazim Fatès (INRIA, France) co-chair
Enrico Formenti (Universite' Nice - Sophia Antipolis, France) co-chair
Eric Goles (Universidad  Adolfo Ibáñez, Chile)
Henning Mortveit (Virginia Bioinformatics Institute, USA)
Ferdinand Peper (National Institute of 
Information and Communications Technology, Japan)
Leonardo Vanneschi (University of Lisboa, Portugal)

8) Special issue of Information and Computation on ICC/DICE

       Special issue of Information and Computation
        Implicit Computational Complexity

	(Deadline extension = 31 January 2012)

Call for Papers
The area of Implicit Computational Complexity 
(ICC) has grown out from several proposals to
use logic and formal methods to provide languages 
for complexity- bounded computation
(e.g. Ptime, Logspace computation). It aims at 
studying computational complexity
without referring to external measuring 
conditions or a particular  machine model, but
only by considering language restrictions or 
logical/computational  principles implying complexity properties.

Contributions on various aspects of 
ICC  including (but not exclusively) are welcome :
- types for controlling complexity,
- logical systems for implicit computational complexity,
- linear logic,
- semantics of complexity-bounded computation,
- rewriting and termination orderings,
- interpretation-based methods for implicit complexity,
- programming languages for complexity bounded computation,
- application of implicit complexity to other 
programming paradigms  (e.g. imperative or object-oriented languages)

- This special issue is a post-conference 
publication of DICE workshop. The first DICE 
workshop was held in 2010 in Lyon, the second in 
Saarbrucken in 2011, and the next one in Tallinn 
(http://dice2012.cs.unibo.it/) in 2012, as satellite events of ETAPS.

- A survey on ICC by P. Baillot, M. Hofmann, D. 
Leivant, J-Y Marion and S. Ronchi Della Rocca is planned.

Submissions, in pdf format, must be sent to 
Jean-Yves Marion at loria.fr no later than

31 January, 2011

But papers will be processed as soon as they are submitted

We encourage to look at http://projects.csail.mit.edu/iandc/info.html
and  the use of Elsevier's elsarticle.cls latex macro package,
that can be retrieved from


- Please send any further inquiry

- See also : http://dice11.loria.fr for updated information


9) LICS 2012 Call for Papers

            Twenty-Seventh Annual ACM/IEEE Symposium on

                   LOGIC IN COMPUTER SCIENCE (LICS 2012)

                            Call for Papers and Highlights of
                                    Changes in 2012

                    June 25--28, 2012, Dubrovnik, Croatia

Highlights and changes for LICS 2012:
Starting with 2012, there will be some changes in the way LICS is
organised, which we highlight here:

- Starting 2012, LICS is jointly organized by ACM and IEEE, and is
cosponsored by ACM SIGACT and the IEEE Computer Society.

- In response to concerns about LICS becoming overly selective with
a too-narrow technical focus, the program committee will employ a
merit-based selection with no a priori limit on the number of
accepted papers.

All papers meeting the LICS quality standards will be published,
regardless of popularity of topic. The programme will be scheduled
to accommodate the accepted papers.

- LICS 2012 will continue the tradition of pre-conference tutorials
that was initiated in 2011.  This year,
* Jan Willem Klop will give a tutorial on term rewrite systems and
* Andre Platzer will give a tutorial on logics of dynamical systems.

-  Special Events and Invited Lectures:
There will be an invited lecture by
* Robert J. Aumann, winner of the 2005 Nobel Prize in Economic
   Sciences, and
* a plenary session in honor of Alan Turing on the occasion of his
    centenary, with talks by
    Robert L. Constable,
    E. Allen Emerson (co-winner of 2008 A. M. Turing Award),
    Joan Feigenbaum, and
   Leonid Levin.

                                    CALL FOR PAPERS

            Twenty-Seventh Annual ACM/IEEE Symposium on

                   LOGIC IN COMPUTER SCIENCE (LICS 2012)

                    June 25--28, 2012, Dubrovnik, Croatia

LICS 2012 will be hosted by the University of Dubrovnik, in Dubrovnik, Croatia,
from June 25th to 28th, 2012.

The LICS Symposium is an annual international forum on theoretical and
practical topics in computer science that relate to logic, broadly construed.
We invite submissions on topics that fit under that
rubric.  Suggested, but not exclusive, topics of interest include:
automata theory, automated deduction, categorical
models and logics, concurrency and distributed computation, constraint
programming, constructive mathematics, database theory, decision
procedures, description logics, domain theory,
finite model theory, formal aspects of program analysis, formal
methods, foundations of computability, higher-order logic, lambda and
combinatory calculi, linear logic, logic in artificial intelligence,
logic programming,  logical aspects of bioinformatics, logical aspects
of computational complexity, logical aspects of quantum computation,
logical frameworks,  logics of programs, modal and temporal logics, model
checking, probabilistic systems, process calculi, programming language
semantics, proof theory, real-time systems, reasoning about security,
rewriting, type systems and type theory, and verification.

Important Dates:
January   6, 2012: Titles & Short Abstracts Due
January 13, 2012: Extended Abstracts  Due
March   25, 2012: Author Notification (approximate)
April     29, 2012: Final Versions Due for Proceedings:

Authors are required to submit a paper title and a short abstract of
about 100 words in advance of submitting the extended abstract of the

At committee discretion, authors will be asked to respond to inquiries
in February or  March.
Deadlines are firm; late submissions will not be considered.
All submissions will be electronic via

Submission Instructions:
Every extended abstract must be submitted in the IEEE Proceedings
2-column 10pt format and may not be longer than 10 pages,
including references.  LaTeX style files
are available on the conference website.

The extended abstract must be in English and provide
sufficient detail to allow the program committee to assess the merits
of the paper.  It should begin with a succinct statement of the issues,
a summary of the main results, and a brief explanation of their
significance and relevance to the conference and to
computer science, all phrased for the non-specialist.
Technical development directed to the specialist should
follow. References and comparisons with related work must be
(If necessary, detailed proofs of technical results may be included in
a clearly-labeled appendix, to be consulted at the discretion of
program committee members.)
Extended abstracts not conforming to the above requirements
will be rejected without further consideration.
There is no a priori limit on acceptances; all quality papers will be
published, regardless of popularity of topic.

Results must be unpublished and not submitted for publication
elsewhere, including the proceedings of other symposia or workshops.
The program chair must be informed, in advance of submission, of any
closely related work submitted or about to be submitted to a
conference or journal.

Authors of accepted papers are expected to sign copyright
release forms.  One author of each accepted paper is expected to
present it at the conference.

Short Presentations:
A session of short presentations, intended for descriptions of
student research, works in progress, and other brief communications,
is planned.   These abstracts will not be published. Dates and
guidelines are posted on the LICS website.

Special Events:
- Invited plenary lecture by Robert J. Aumann, winner of the 2005
Nobel Prize in Economic Sciences.
- Two plenary sessions in honor of Alan Turing on 
the occasion of his centenary, featuring talks by
Robert L. Constable, E. Allen Emerson, Joan Feigenbaum, and Leonid Levin.
- Pre-conference tutorials on Sunday, June 24,  by
* Jan Willem Klop (rewriting systems) and
* André Platzer (logic of dynamical systems).
- Associated workshops on Sunday, June 24, and on Friday, June 29.

Kleene Award for Best Student Paper:
An award in honor of the late Stephen C. Kleene will be given for the
best student paper(s), as judged by the program committee.

Special Issues:
Full versions of up to three accepted papers, to 
be selected by the program committee, will be invited
for submission to the Journal of the ACM. 
Additional selected papers will be invited to a special issue of
Logical Methods in Computer Science.

Program Chair:
Nachum Dershowitz, Tel Aviv University

Program Committee:
Christel Baier, Dresden Univ. of Technology
Lev Beklemishev, Steklov Inst of Mathematics
Andreas Blass, Univ. of Michigan
Manuel Bodirsky, École Polytechnique
Mikolaj Bojanczyk, Warsaw Univ.
Ahmed Bouajjani, Univ. Paris Diderot
Patricia Bouyer-Decitre, CNRS
Andrei Bulatov, Simon Fraser Univ.
Hubert Comon-Lundh, ENS Cachan
Anuj Dawar, Univ. of Cambridge
Gilles Dowek, INRIA
Martín Escardó, Univ. of Birmingham
Maribel Fernández, King's College London
Rob van Glabbeek, NICTA
Rosalie Iemhoff, Utrecht Univ.
Neil Immerman, UMass, Amherst
Max Kanovich, Queen Mary, Univ. of London
Naoki Kobayashi, Tohoku Univ.
Orna Kupferman, Hebrew Univ.
Marta Kwiatkowska, Univ. of Oxford
Olivier Laurent, CNRS -- ENS Lyon
Richard Mayr, Univ. of Edinburgh
Andrzej Murawski, Univ. of Leicester
David Plaisted, Univ. North Carolina, Chapel Hill
Davide Sangiorgi, Univ. of Bologna

Conference Chairs:
Vlatko Lipovac, Univ. of Dubrovnik
Andre Scedrov, Univ. of Pennsylvania

Workshop Chairs:
Adriana Compagnoni, Stevens Inst. of Technology
Maribel Fernáandez, King's College London

Publicity Chairs:
Stephan Kreutzer, Berlin Univ. of Technology
Andrzej Murawski, Univ. of Leicester

Martín Escardó, Univ. of Birmingham

General Chair:
Rajeev Alur, Univ. of Pennsylvania

Organizing Committee:
M. Abadi, R. Alur (chair), F. Baader, P. Beame, S. Buss, E. Clarke,
A. Compagnoni, N. Dershowitz, M. Escard'o, M. Fern'andez, L. Fortnow,
J. Giesl, M. Grohe, J.-P. Jouannaud, P. Kolaitis, 
S. Kreutzer, B. Larose, V. Lipovac,
J. Makowsky, B. Monien, A. Murawski, A. Scedrov,
P. Scott, M. Valeriote

Advisory Board:
M. Abadi, S. Abramsky, Y. Gurevich, T. Henzinger, 
C. Kirchner, P. Kolaitis, D. Kozen, U. Martin,
J. Mitchell, L. Ong, L. Pacholski, P. Panangaden, 
G. Plotkin, A. Scedrov, M. Vardi,
G. Winskel

The symposium is sponsored by the IEEE Technical Committee on
Mathematical Foundations of Computing and by ACM SIGACT,
in cooperation with the Association for Symbolic Logic and the
European Association for Theoretical Computer Science.

Please see the LICS website 
url{http://informatik.hu-berlin.de/lics/lics12 for further information.


10) "The Mathematical Legacy of Alan Turing" 
(Spitalfields Day), Cambridge (U.K.), 9 January 2012

Public opening of the SAS programme (Spitalfields 
Day) "The Mathematical Legacy of Alan Turing"

   9th January 2012


On the 9th January 2012, the programme "Semantics 
& Syntax" will be officially opened. In addition 
to being the official opening of the programme, 
this event will provide the general mathematical 
public (with strong emphasis on postgraduate 
students) a glimpse of the current state of the 
art and explain what is going to happen during the six months at Cambridge.

The day is one of the Spitalfields Days of the 
London Mathematical Society, named in honour of 
the Spitalfields Mathematical Society, a 
precursor of the London Mathematical Society 
which flourished from 1717 to 1845. Spitalfields 
Days provide survey lectures aimed at a general mathematical audience.

With four survey lectures of leading experts of 
the field, we shall allow everyone who is 
planning to be engaged with the programme to 
glimpse of the relevance and the importance of 
the involved fields. We shall also offer 
postgraduate students the opportunity of 
collecting information about how they can get 
involved with the programme as workshop participants or junior fellow.

We invite interested researchers and postgraduate 
students from all institutions in the UK to come and listen to the tutorials.

The speakers are:

    Dr George Barmpalias (Chinese Academy of 
Sciences, China): Measures of relative complexity
    Professor Anuj Dawar (University of 
Cambridge, UK): On Syntactic and Semantic Complexity Classes
    Professor Nigel Smart (University of Bristol, UK) on modern cryptography
    Professor Hugh Woodin (UC Berkeley, USA) on 
Slaman-Woodin conjecture and structure of the Turing degrees

Anyone interested is welcome to attend; talks 
will be aimed at a general mathematical audience. 
Please let the Programme and Visitor Officer at 
the Institute know if you intend to come by 
emailing the Programme and Visitor Officer at programmes at newton.ac.uk.

There will be no accommodation available from the 
Institute, therefore participants are encouraged 
to make their own arrangments. Our suggested 
accommodation listing can be found here.

The London Mathematical Society supports the 
Spitalfields Day by providing a limited number of 
modest travel grants (£100) for postgraduate 
students. If you wish to apply for such a grant, 
please contact the organizer at bloewe at science.uva.nl by 15 December 2011.


11) CFP IJ Unconv. Comp.  spc is. on  New Worlds of Computation

CALL    for      PAPERS

   International Journal of Unconventional Computing

Special issue on

   New Worlds of Computation


This special issue is a sequel to the
Worskop New Worlds of Computation (NWC '11)
May 23-24, 2011, Orléans, FRANCE

Submission is open (i.e. NOT restricted to NWC participants)


The special issue aims at gathering papers from a wide beyond-Turing
(and off-Turing) community in order to bring forth common
problematics as well as divergent results.

The New Worlds of Computation workshop series concentrates on 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
   * Spatial computing
   * Abstract geometrical computation
   * Cellular automata
   * Collision based, quantum, fuzzy, 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
venture 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 or have very
different complexity classes. Unfortunately, there is no miraculous
generalized Church-Turing thesis (nor specialized analog nor...).

The audience aimed at is roughly the same as:

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


Submission      January 23th 2012
Notification    May 2nd 2012

Submission is handled with easychair:


Guest editor

Jérôme Durand-Lose contact: jerome.durand-lose at univ-orleans.fr
LIFO (Laboratoire d'Informatique Fondamentale d'Orléans),
Université d'Orléans


12) Symposium on the History and Philosophy of 
Programming, Birmingham (U.K.), July 2012


Symposium on the History and Philosophy of Programming
5-6 July 2012


as part of

AISB/IACAP World Congress 2012 - Alan Turing 2012
2-6 July 2012



As part of the AISB/IACAP World Congress programme, the Centre for Logic
and Philosophy of Science at Ghent University organizes a one day
Symposium on the History and Philosophy of Programming.

On the Occasion of the Turing Centennial, from 2-6 July 2012, the AISB
(The Society for the Study of Artificial Intelligence and Simulation of
Behaviour) and the IACAP (The International Association for Computing
and Philosophy) merge their annual symposia/conferences to the
AISB/IACAP World Congress. The Congress serves both as the year's AISB
Convention and the year's IACAP conference. The Congress has been
inspired by a desire to honour Alan Turing, and by the broad and deep
significance of Turing's work to AI, to the philosophical ramifications
of computing, and to philosophy and computing more generally. The
Congress is one of the events forming the Alan Turing Year


The intent of the Congress is to stimulate a particularly rich
interchange between AI and Philosophy on any areas of mutual interest,
whether directly addressing Turing's own research output or not.


This Symposium follows the organization of the International Conference
on History and Philosophy of Computing, held at the University of Ghent
from 7 to 10 November 2011


A historical awareness of the evolution of computing not only helps to
clarify the complex structure of the computing sciences, but it also
provides an insight in what computing was, is and maybe could be in the
future. Philosophy, on the other hand, helps to tackle some of the
fundamental problems of computing.  The aim of this conference is to
zoom into one fundamental aspect of computing, namely the foundational
and the historical problems and developments related to the science of

Alan Turing himself was driven by the fundamental question of ?what are
the possible processes which can be carried out in computing a
number? [Turing, 1936]. His answer today is well-known, and today we
understand a program as a rather complex instance of what became known
as the Turing Machine. What is less well-known, is that Turing also
wrote one of the first programming manuals ever for the Ferranti Mark I,
where one feels the symbolic machine hiding on the back of the
Manchester hardware. This was only the beginning of a large research
area that today involves logicians, programmers and engineers in the
design, understanding and realization of programming languages.

That a logico-mathematical-physical object called `program' is so
controversial, even though its very nature is mostly hidden away, is
rooted in the range of problems, processes and objects that can be
solved, simulated, approximated and generated by way of its execution.
Given its widespread impact on our lives, it becomes a responsibility of
the philosopher and the historian to study the science of programming.



The historical and philosophical reflection on the science of
programming is the main topic at the core of this Symposium and we
expect contributions about the following topics and their intersections:

1. The history of computational systems, machines and programs
2. Foundational issues and paradigms of programming (programming logics,
semantics and proof-theories for distributed, secure, cloud, functional,
object-oriented, etc.)

Our wish is to bring forth to the scientific community a deep
understanding and critical view of the problems related to the
scientific paradigm represented by the science of programming. Possible
and in no way exclusive questions that might be of relevance to this
Symposium are:

- What was and is the significance of hardware developments for the
development of software (and vice versa)? - In 
how far can the analogue and special-purpose machines built before
the 40s programs and what does this mean for our conception of ?program?
today? - How important has been the hands-off vs. the hands-on approach for the
development of programming? - What is the 
influence of models of computability like Church's
lambda-calculus on the development of programming languages?
- Which case studies from the history of programming can tell us today
something about future directions? - Is 
programming a science or a technology? - In how 
far does it make sense to speak about programming paradigms in
the sense of Kuhn? - What are the novel and most 
interesting approaches to the design of
programs? - What are the most interesting formal properties of procedural
semantics, typed systems, etc?
- What is correctness for a program? Issues in Type-checking,
Model-checking, etc.
- What is the common structure of Proofs and Programs? Logic of Proofs
and Curry-Howard Isomorphism.
- What are the current logical issues in programming?
- How do we understand programs as syntactical-semantical objects?
- What is the nature of the relation between algorithms and programs? -
What is a program? - Which problems are the most 
pressing ones and why are they relevant to
more than just programmers?
- How can epistemology profit from the understanding of programs'
behavior and structure?
- What legal and socio-economical issues are involved in the creation,
patenting or free-distribution of programs?


The programme will consists of 2 Invited Lectures and up to 8
Contributed Papers. It will takes place in the afternoon session of the
5th and the morning session of the 6th of July. We cordially invite
researchers working in a field relevant to the main topics of the
conference to submit an extended abstract of minimum 2 and maximum 5
pages to

computing.conference at ugent.be

Please mention "ABSTRACT HAPOP" in the subject line. Abstracts must be
written in English. Please note that the format of submitted files must
be .pdf or .rtf. Only unpublished material will be considered for

Submissions Deadline: 1 February 2012
Acceptance/rejection Decisions: 1 March 2012
Final versions of abstracts for inclusion in proceedings: 30 March 2012.
Symposium: 5 July (afternoon) and 6 July (morning)


Gerard Alberts (Universiteit van Amsterdam)
Julian Rohrhuber (Robert Schumann Hochschule Duesseldorf)


Liesbeth De Mol and Giuseppe Primiero?

S. Artemov (City Univeristy of New York)
M. Bullynck (Universite' de Paris 8)
L. de Mol (CLPS UGent)
V. de Paiva (Reardem Commerce)
H. Durnova (Masarykova Univerzita Brno)
R. Kahle (Universidade Nova de Lisbona)
B. Loewe (Universiteit van Amsterdam)
F. Kamareddine (Heriot-Watt University Edinburgh)
G. Primiero (CLPS UGent)
R. Turner (University of Essex)


There will be a separate proceedings for each symposium, produced before
the Congress. Each delegate at the Congress will receive, on arrival, a
memory stick containing the proceedings of all symposia.


For further information please contact us at:?

computing.conference at ugent.be

or have a look at our website:



The Symposium on History and Philosophy of Programming will be followed
by a Roundtable on topics in the Philosophy of Computer Science on the
day after. Confirmed participants include:

Raymond Turner, University of Essex, UK (MODERATOR)
Rainhard Bengez, TU München, Germany
Manfred Broy, TU München, Germany,
Marcelo Dascal, University of Tel Aviv, Israel
Ruth Hagengruber, University of Paderborn, Germany
Giovanni Sartor, EUI ? European University Institute, Florence, Italy
Dov M. Gabbay, King's College, London, UK
Jean-Gabriele Ganascia, University Pierre and Marie Curie, Paris, France
Gilles Dowek, l'Ècole polytechnique, Paris, 
France Jan van Leeuwen, Universiteit Utrecht, The Netherlands
Lothar Philipps, University of Munich, Germany
Giovanni Sartor, EUI ? European University Institute, Florence, Italy
Kevin Ashley, University of Pittsburgh, USA
Hennry Prakken,  Universiteit Utrecht, The Netherlands
Erich Schweighofer, University of Vienna, Austria
Yoshino Hajime, Meiji Gakuin University, Tokio, Japan
Douglas Walton, University of Windsor, Canada

Topics include:
*Philosophical approaches to Computer Science
*Just Counting Machines? From Leibniz via Lovecraft and Babbage to
Turing, Zuse and von Neumann.
*Which kinds of logic and mathematical concepts are suitable for
machines and humans to understand machines?

Everyone is cordially invited





AISB/IACAP World Congress 2012
in honour of Alan Turing

July 2nd to 6th, 2012
University of Birmingham, Birmingham, UK

or via

organized by

*** Society for the Study of Artificial Intelligence
                     and Simulation of Behaviour (AISB)

*** International Association for Computing and Philosophy (IACAP)

PAPERS. Please consult the individual calls via the above Congress
page. The due date for abstracts or papers (depending on the Symposium)
is 1 February 2012.



-- Mathematical Practice and Cognition II

-- Hypercomputation and Artificial Intelligence

-- Computing, Philosophy and the Question of Bio-Machine Hybrids
  (4th AISB Symposium on Computing and Philosophy)

-- Computational Philosophy

-- Turing Arts Symposium

-- History and Philosophy of Programming
    together with a Roundtable Discussion on
    Philosophy of Computer Science: PoC Meets AI and Law

Symposium Group on Turing Tests and Dialogue Agents:

-- Revisiting Turing and his Test:
         Comprehensiveness, Qualia, and the Real World

-- Linguistic and Cognitive Approaches To Dialog Agents (LaCATODA 2012)

Symposium Group on Social/Collective Systems, Networks and Phenomena:

-- Social Computing - Social Cognition - Social Networks
   and Multiagent Systems

-- Understanding and Modelling Collective Phenomena (UMoCoP)

Symposium Group on Ethics, Morality, AI and Mind:

-- Framework for Responsible Research and Innovation in AI

-- The Machine Question: AI, Ethics, and Moral Responsibility

-- Moral Cognition & Theory of Mind

Symposium Group on Natural and Unconventional Computing:

-- Natural Computing/Unconventional Computing
                   and its Philosophical Significance

-- Nature-Inspired Computing and Applications: 1st Symposium (NICA)



AISB and IACAP have joined forces to run the above Congress in 2012. The
Congress serves both as the year's AISB Convention and the year's IACAP
conference.  The Congress has been inspired by a desire to honour Alan
Turing and by the broad and deep significance of Turing's work to AI, to
the philosophical ramifications of computing, and to philosophy and
computing more generally. The Congress is one of the events forming the
Alan Turing Year (http://www.mathcomp.leeds.ac.uk/turing2012/).

The intent of the Congress is to stimulate a particularly rich
interchange between AI and Philosophy on any areas of mutual interest,
whether directly addressing Turing's own research output or not.

Invited Plenary Speakers

Four invited Plenary speakers have so far been secured, namely:


  Provost Professor of Cognitive Science
                and of History & Philosophy of Science
  Department of Philosophy and Philosophy of Science
  Indiana University,
  Bloomington, IN, USA



  Research Chair in Philosophy of Information
  and UNESCO Chair of Information and Computer Ethics
  University of Hertfordshire, UK
  Director, Information Ethics research Group
  and Fellow of St Cross College
  University of Oxford, UK



  Honorary Professor
  School of Computer Science
  University of Birmingham, UK



  Founder and CEO
  Wolfram Research, Inc.
  Champaign, IL, USA


In addition, Alan Turing's nephew SIR JOHN DERMOT TURING will give a short
speech at the Congress Dinner on Thursday 5th July.

Congress Chairs

Overall Chairs:

Anthony Beavers
Philosophy and Cognitive Science
The University of Evansville
1800 Lincoln Avenue
Evansville, Indiana 47722 USA

+1 812-488-2682
afbeavers at gmail.com

(Tony is the President of IACAP)

John Barnden
School of Computer Science
University of Birmingham
Birmingham, B15 2TT

+44 (0)121-414-3816
J.A.Barnden at cs.bham.ac.uk except during August 2011
j.a.barnden at btinternet.com during August 2011

(John is currently Vice-Chair of AISB,
  and was Chair from 2003 to 2010)

Local Chair and Deputy Programme Chair:

Dr Manfred Kerber

School of Computer Science
University of Birmingham
Birmingham, B15 2LY

M.Kerber at cs.bham.ac.uk



(From Paulo Oliva)


School of Electronic Engineering and Computer Science
Queen Mary University of London

Applications are invited for three PhD Studentships starting in September 2012

  * Paul Curzon, Formal verification of healthcare information systems

  * Ursula Martin, Crowdsourced math: doing mathematics on the web

  * Paulo Oliva, Game theory and higher-order computability

The students will be part of the School of Electronic Engineering and Computer

Science (EECS) www.eecs.qmul.ac.uk at Queen Mary, University of London, in the

Theory  Group, www.eecs.qmul.ac.uk/research/logic/QM-EECS-TCS

The group has a world-leading reputation for fundamental theoretical work, with

practical impact on understanding and creating 
robust reliable software. The group

comprises 30 academic and research staff, and 
formed around a third of QMUL’s RAE

2008 Computer Science submission, ranked 8th in 
the UK for output quality. Recent

strategic investment has included a new 
Professor, Byron Cook (a joint appointment

with Microsoft Research, who also sponsor 
O’Hearn’s chair through the Royal Academy

of Engineering); and 3 new lecturers. The group holds 8 competitive external

fellowships from EPSRC, Royal Academy of 
Engineering and Royal Society; £14 million

in external funding, including £10 million from 
EPSRC; and £800K from industry and

UK and US government agencies. Major EPSRC 
projects include two multimillion programme

grants (O’Hearn, Cook; Curzon), and a £3 million 
Knowledge Transfer grant (Martin).

For further details and instruction on eligibility and how to apply see:



15) Workshop on Turing's Legacy in Mathematics 
and Computer Science, BMC 2012, Canterbury, Kent, 16-19 April 2012

Workshop on Turing's Legacy in Mathematics and Computer Science

BMC 2012, Canterbury, Kent, 16-19 April 2012

Call for Contributions

The 2012 British Mathematical Colloquium will take place at the University
of Kent 16-19 April 2012, in the centenary year of Alan Turing's birth.
Solomon Feferman (Stanford) will give a plenary presentation on
mathematical aspects of Turing's work and Andrew Hodges, author of "Alan
Turing: the Enigma", will give a public lecture on Turing's life and work.
Other lectures will be given by David Harel (Weizmann Institute of
Science) on modelling biological systems and Sue Black (UCL) on Bletchley

This workshop - which will take place on the afternoons of 17 and 18 April
- seeks participants from mathematics, computer science, artificial
intelligence, philosophy and biosciences to address Turing's legacy in
these fields. Talks are typically 30 minutes, but short talks and
demonstrations as well as other formats, are actively encouraged.

Submissions for the workshop to be send to SImon Thompson, School of
Computing, University of Kent: email s.j.thompson at kent.ac.uk

More details of the BMC at

Online registration for the BMC is now available at


16) Seventh International Conference on 
Computability, Complexity and Randomness (CCR 2012)

(From Elvira Mayordomo)


First Call for Papers and Announcement
Seventh International Conference on 
Computability, Complexity and Randomness (CCR 2012)

July 2-6, 2012, Cambridge, Great Britain

Submission deadline: February 25, 2012 (Abstracts only!)

The conference will be held at the Isaac Newton 
Institute for Mathematical Sciences (INI) as a 
part of the INI programme Semantics and Syntax: A 
Legacy of Alan Turing. CCR 2012 is part of the Alan Turing Year Events.

The conference CCR, also known as conference on 
Logic, Computability and Randomness, will be in 
the tradition of the previous meetings in Córdoba 
(Argentina) 2004, Buenos Aires (Argentina) 2007, 
Nanjing (China) 2008, Luminy (France) 2009, Notre 
Dame (USA) 2010, and Cape Town (South Africa) 2011.


   Algorithmic randomness,
   Computability theory,
   Kolmogorov complexity,
   Computational complexity,
   Reverse mathematics and logic.

Confirmed Invited Speakers

   George Barmpalias (Beijing, China),
   Vasco Brattka (Cape Town, South Africa),
   Adam Day (Berkeley, United States),
   John Hitchcock (Laramie, United States),
   Mathieu Hoyrup (Nancy, France),
   Michal Koucký (Prague, Czech Republic),
   Andy Lewis (Leeds, Great Britain),
   Jack Lutz (Ames, United States),
   André Nies (Auckland, New Zealand),
   Alexander Shen (Marseille, France),
   Steve Simpson (State College, United States),
   Dan Turetsky (Wellington, New Zealand).

Programme Committee

   Laurent Bienvenu (Paris, France),
   Péter Gács (Boston, United States),
   Antonin Kucera (Prague, Czech Republic),
   Elvira Mayordomo (co-chair) (Zaragoza, Spain),
   Wolfgang Merkle (co-chair) (Heidelberg, Germany),
   Nikolai Vereshchagin (Moscow, Russia),
   Paul Vitányi (Amsterdam, Netherlands).


Authors are invited to submit a PDF abstract 
(typically 1-2 pages) via the following web page:


No full papers will be required for this conference.


No proceedings will be published before the 
conference. A booklet with abstracts will be made 
available at the conference. It is planned to 
publish post-conference proceedings in a special 
issue of some journal afterwards. The special 
issue will be refereed according to the usual standards of the journal.


The Isaac Newton Institute has limited funds for 
supporting participants. Applications for funding 
are particularly welcomed from early career 
researchers and those from under-represented 
groups. Funding may be available to support 
attendance, including from the Institute's Junior 
Membership scheme for eligible participants.

Additional funding is pending. Funding opportunities for student members of the
Association for Symbolic Logic (ASL) are anticipated.


Submission deadline:     25 February 2012,
Notification of authors:     30 March 2012,
Final version:     28 April 2012,
Conference:     2-6 July 2012.

Conference Web Page



17) Estonian Winter School in Comput Sci 2012, call for participation

[Lecturers: Dimitrov, Escardó, Italiano, Nordström, Yi.
Place/time: Palmse, Estonia, 26 Feb-2 March 2012.
Deadline for application and submission of abstracts for student
talks: ** 13 Jan 2012 **.]

                       CALL for PARTICIPATION

         17th Estonian Winter School in Computer Science, EWSCS '12

                 Palmse, Estonia, 26 Feb-2 March 2012



EWSCS is a series of regional-scope international winter schools held
annually in Estonia. EWSCS are organized by Institute of Cybernetics,
a research institute of Tallinn University of Technology.

The main objective of EWSCS is to expose Estonian, Baltic, and Nordic
graduate students in computer science (but also interested students
from elsewhere) to frontline research topics usually not covered
within the regular curricula. The working language of the schools is

EWSCS '12 is the seventeenth event of the series.


The schools' scientific programme consists of short courses by
renowned specialists and a student session.

Courses of EWSCS '12

* Vassil S. Dimitrov (University of Calgary, Canada):
  Computational number theory and its applications

* Martín Escardó (University of Birmingham, UK):
  Topology for functional programming

* Giuseppe Italiano (Università di Roma "Tor Vergata", Italy):
  Dynamic graph algorithms

* Jakob Nordström (KTH Royal Institute of Technology, Sweden):
  Time-space trade-offs in proof complexity

* Kwangkeun Yi (Seoul National University, South Korea):
  Collage of static analyses in practice and theory

The purpose of the student session is to give students an opportunity
to present their work (typically, thesis work) and get
feedback. Registrants are invited to propose short talks (20 min) on
topics of theoretical computer science, broadly understood. The
selection will be based on abstracts of 150-400 words.

The social programme consists of an excursion and a conference dinner.


Palmse is a small settlement 80 kms to the east from Tallinn in the
county of Lääne-Viru. It is renowned for a large manor that used to
belong to the von Pahlen family, today hosting the visitors' center of
the Lahemaa National Park, a museum, and a hotel.

Tallinn, Estonia's capital, is famous for its picturesque medieval Old
Town, a UNESCO World Heritage site. In 2011, Tallinn, along with Turku
in Finland, was the cultural capital of Europe. There are direct
flights to Tallinn Lennart Meri airport from Amsterdam, Bremen,
Brussels, Copenhagen, Dublin, Düsseldorf Weeze, Frankfurt, Girona,
Gothenburg, Helsinki, Kiev, Liverpool, London Gatwick, Luton and
Stansted, Milan Bergamo, Moscow Sheremetyevo and Vnukovo, Munich, Oslo
Gardermoen and Rygge, Oulu, Prague, Riga, Stockholm Arlanda, Bromma
and Skavsta, St Petersburg, Tampere, Trondheim, Turku, Vaasa, Warsaw
and Vilnius, ferries from Stockholm and Helsinki. From Vilnius, Riga,
St Petersburg the Lux Express and EcoLines coach services are the
practical travel option.


The deadline for application and submission of student talk abstracts
is 13 January 2012. All applicants will be notified of admission to
the school and acceptance of their talks by 27 January 2012.

Admitted applicants are entitled and expected to attend the courses
and student session of the school. They will also receive a binder
with the course material and access to additional materials on the
school website.

The participation fee is 320 EUR and includes full board accommodation
at Palmse, transportation from Tallinn to Palmse, the excursion and
conference dinner (by contributing towards the associated expense).

We may be able to reduce the fee for a small number of participants.
To apply for fee reduction, please fill in the online fee reduction
request form.


    * Tarmo Uustalu (Institute of Cybernetics) (chair)
    * Monika Perkmann (Institute of Cybernetics) (secretary)
    * Peeter Laud (Cybernetica AS)
    * Varmo Vene (University of Tartu)
    * Sven Laur (University of Tartu)


    * Tiger University Plus programme
      of the Estonian Information Technology Foundation
    * Estonian Centre of Excellence in Computer Science, EXCS,
      funded by the European Regional Development Fund


Details on the application procedure and cost, submission of student
talk abstrats are available from the school webpage,
http://cs.ioc.ee/ewscs/2012/.  Questions should be sent to


18) 4th Automata, Theory and Applications Workshop Message

Call for Papers
4th Automata, Theory and Applications Workshop (*A-CSC’12)
(formerly CA-CSC’12)
within The 2012 International Conference on Scientific Computing (CSC'12)

July 16-19, 2012, Las Vegas, USA

Deadline: March 15, 2012

Dear Professionals and Research Students working 
in areas involving both theory and application 
fields of computer science, we are inviting you to join us for our:
4th Automata, Theory and Applications Workshop 
(formerly, Cellular Automata, Theory and 
Applications Workshop) within The 2012 
International Conference on Scientific Computing 
(CSC'12: July 16-19, 2012, Monte Carlo Resort, Las Vegas, USA),
one of 22 conferences at WORLDCOMP'12 - The 2012 
World Congress in Computer Science, Computer 
Engineering, and Applied Computing.

Chairs of Session: Lou D'Alotto*, J.F. Nystrom**, William Spataro***

* York College/CUNY and The CUNY Graduate Center, 
New York, USA, ldalotto at york.cuny.edu
**Ferris State University, Michigan, USA, JamesNystrom at ferris.edu
***University of Calabria, Italy, spataro at unical.it

Deadline for the full paper submission is March 15, 2012.

Official CFP
Following the success of our previous Cellular 
Automata, Theory and Applications Workshop, which 
included exciting keynotes addressed from leading 
Cellular Automata researchers, Prof. Dr. Peter 
Sloot, and by Prof. Yaroslav D. Sergeyev, father 
of the Infinity Computer, we are glad to invite 
you to our fourth edition. From this year, topics 
of the Workshop have been extended to the more 
general Automata theme, including both 
theoretical and applicative aspects of this important computer science field.

The main objective of this Workshop, organized 
within the 2012 World Congress in Computer 
Science, Computer Engineering, and Applied 
Computing (WORLDCOMP'12), is to offer scientists, 
researchers and engineers an opportunity to 
express and confront their views on trends, 
challenges, and state-of-the art in both theory 
and diverse application fields such as 
engineering, physics, chemistry, biology, 
geology, medicine, ecology, sociology, traffic control, economy, etc.

Distinguished papers will be published in a 
special issue of the Journal of SuperComputing, a 
leading ISI research journal publishing 
theoretical, practical, tutorial and survey 
papers on all aspects of supercomputing.

Please see other publication details below.

Topics of interest include, but are not limited to:
- cellular automata
•	theoretical
•	systems modeling
•	other applications
- finite automata
- formal language theory
- theoretical issues on automata theory
- parallel implementations

Prospective authors are invited to submit their 
draft papers directly to the Workshop Chairs (see 
emails above). Please include “*A ­ CSC’12” in 
the email subject header. Submissions must be 
received by March 15, 2012 and they must be in 
either MS doc (not docx) or pdf formats (about 5 
to 7 pages - single space, font size of 10 to 
12). All reasonable typesetting formats are 
acceptable (later, the authors of accepted papers 
will be asked to follow a particular typesetting 
format to prepare their papers for publication.) 
The length of the Camera-Ready papers (if 
accepted) will be limited to 7 (IEEE style) 
pages. Papers must not have been previously 
published or currently submitted for publication 
elsewhere. The first page of the draft paper 
should include: title of the paper, name, 
affiliation, postal address, and email address 
for each author. The first page should also 
identify the name of the Contact Author and a 
maximum of 5 topical keywords that would best represent the co
ntent of the paper. Finally, the name of the 
conference (CSC'12) must be stated on the first page.

March 15, 2012:  Submission of papers (about 5 to 7 pages)
April 13, 2012:  Notification of decision
April 30, 2012:  Final papers + Copyright + Registration
July 16-19, 2012: The 2012 World Congress in 
Computer Science, Computer Engineering, and 
Applied Computing (WORLDCOMP'12 - 22 joint conferences)

(RRP)  Regular Research Papers: 7-page IEEE-style 
publication in the proceedings. 20-minute formal presentation slot.
(RRR)  Regular Research Reports: 7-page 
IEEE-style publication in the proceedings. 
Presentation in an informal setting (during 
Discussion Sessions.) Typically, those authors 
with language difficulties prefer this mode of presentation.
(SRP)  Short Research Papers: 4-page IEEE-style 
publication in the proceedings. Presentation in 
an informal setting (during Discussion 
Sessions.)  Same presentation mode as RRR papers.
(PST)   Posters 1-page IEEE-style publication in 
the proceedings. Presentation in an informal 
setting (during Discussion Sessions.

All accepted papers will be published in the 
general CSC conference proceedings (in both, 
printed book form as well as online). The 
proceedings will be indexed in Inspec / IET /The 
Institute for Engineering and Technology, DBLP / 
Computer  Science Bibliography, and others.) The 
printed proceedings will be available for 
distribution on site at the conference.

The 4th Automata, Theory and Applications 
Workshop, together with all other WORLDCOMP 
Workshops and Conferences, will be held at Monte 
Carlo Resort, Las Vegas, Nevada, USA (with any 
overflows at other near-by hotels). This is a 
mega hotel with excellent conference facilities 
and over 3,000 rooms. It is minutes from the 
airport with 24-hour shuttle service to and from 
the airport. This hotel has many recreational 
attractions, including: waterfalls, spa, pools, 
sunning decks, Easy River, wave pool, nightly 
shows, many restaurants, etc. The negotiated room 
rate for conference attendees is very reasonable.
More information about the *A-CSC 2012 Workshop 
and the general CSC 2012 conference and WorldComp’12 congress can be found at:



We are looking forward to welcoming you in Las Vegas!
Lou D'Alotto, J.F. (Jim) Nystrom, and William Spataro, Co-chairs


19) Congress for Alan Turing's Centenary: "Per il 
centenario di Alan Turing, fondatore dell'informatica." Roma, Acc. Naz.
dei Lincei, Palazzo Corsini.

This is to announce that the

Accademia Nazionale dei Lincei, Italy

organizes a congress on November the 22nd, 2012
in order to commemorate Alan Turing:

"Per il centenario di Alan Turing, fondatore dell'informatica."
Roma, Acc. Naz. dei Lincei, Palazzo Corsini.

All aspects of the activity of Allan Turing will be
illustrated. Lecturers:
Giorgio Ausiello, Dino Buzzetti, Luigia Carlucci Aiello,
Carlo Cellucci, Gabriele Lolli, Angelo R. Meo, Daniele Mundici,
Tito Orlandi, Pino Persano, Gino Roncaglia.



       	2nd CALL for PARTICIPATION

                        SOFSEM 2012

        38th International Conference on Current Trends
           in Theory and Practice of Computer Science
                      January 21-27, 2012
               Orea Hotel HORAL (Spindleruv Mlyn)
                        Czech Republic

Dear Sofsemists,
       dear Colleagues and Friends,

It is our great pleasure to invite you to participate
at the upcomming SOFSEM 2012 conference
with the following four tracks:


We would especially like to attract your attention to the


In memory of Alan Turing, whose 100th anniversary is celebrated in 2012,
SOFSEM 2012 will host a session on Turing machines. The session will
consist of invited and contributed talks on Turing machines as the basic
model of computability and complexity. SOFSEM 2012 is among the official
Centenary Events of The Alan Turing Year
(for more details see http://www.turingcentenary.eu/)

We hope that you will find the SOFSEM 2012 tracks - for details


very interesting and inspiring. Moreover, as usual at SOFSEM conferences,
a very distinguished feature is the higher number of Invited Speakers.

The list of SOFSEM 2012 invited speakers:

* Foundations of Computer Science Track:

- Yuri Gurevich (University of Michigan and Microsoft Research, USA)
What's an Algorithm?

- Giuseppe F. Italiano (University of Rome "Tor Vergata", Italy)
Strong Bridges and Strong Articulation Points of Directed Graphs


- Felipe Cucker (City University of Hong Kong, Hong Kong )
The Legacy of Turing in Numerical Analysis

- Peter van Emde Boas (University of Amsterdam, The Netherlands )
Turing Machines for Dummies

- Jiri Wiedermann (Institute of Computer Science, Academy of Sciences,
Czech Republic )
Towards Computational Models of Artificial Cognitive Systems that Can,
in Principle, Pass the Turing Test

* Software & Web Engineering Track:

- Paul De Bra (Eindhoven University of Technology, The Netherlands)
A Fully Generic Approach for Realizing the Adaptive Web

- Pavel Zezula (Masaryk University in Brno, Czech Republic)
Multi Feature Indexing Network (MUFIN) - Similarity Search Platform
for many Applications

* Cryptography, Security, and Verification Track:

- Orna Kupferman (Hebrew University in Jerusalem, Israel)
Recent Challenges and Ideas in Temporal Synthesis

- Krzysztof Pietrzak (Cryptology Research Group, CWI Amsterdam,
The Netherlands)
Efficient Cryptography from Hard Learning Problems

* Artificial Intelligence


- Roberto Navigli (Sapienza University of Rome, Italy )
Don't Take Shortcuts! Computational Lexical Semantics and the Turing Test

- Kevin Warwick (University of Reading, United Kingdom )
Not Another Look at the Turing Test!

We are sure each SOFSEM 2012 Invited Speaker will deliver a wonderfull
Invited Talk the SOFSEM 2012 participants will fully enjoy similarly to the
43 accepted papers (from the 121 submitted: ~ 36 %  acceptance rate -
the complete list is at:

Student Research Forum

The Student Research Forum (SRF) is organized as an integral part of the
SOFSEM 2012 with the aim to publish and discuss student projects in the
areas of the 4 SOFSEM 2012 tracks.
The SRF will offer students the opportunity to receive valuable feedback
on the originality and quality of their scientific work results as the
authors of the papers selected for SRF will present their ideas in front
of the main SOFSEM 2012 audience and also during the poster session
organized as a integral part of the conference.

Best Student Paper and Best Student Presentation will be awarded during the

Location, venue and leisure activities of SOFSEM 2012 are presented at:

Conference:                           January 21-27, 2012

We are looking forward to welcome you at SOFSEM 2012.

Please do not hesitate to contact us in case you have any questions.

On behalf of all SOFSEM 2012 organizers,

Georg Gottlob (Program Committee Chair)
Julius Stuller (Steering Committee Chair)


21) "Natural/Unconventional Computing and its 
philosophical significance", Birmingham (U.K.), 2-3 July 2012


AISB/IACAP, 2nd - 6th July 2012

https://sites.google.com/site/naturalcomputingaisbiacap2012  &

Symposium on Natural computing/unconventional computing and its
philosophical significance
https://sites.google.com/site/naturalcomputingaisbiacap2012 is part of the
AISB/IACAP World Congress 2012 in honour of Alan Turing, 2-6  July 2012
** **
Natural/Unconventional Computing:****
SUSAN STEPNEY (keynote) http://www-users.cs.york.ac.uk/susan****
BARRY S. COOPER (keynote) http://www1.maths.leeds.ac.uk/~pmt6sbc****
HECTOR ZENIL (invited) http://www.mathrix.org/zenil****
RON COTTAM (invited) http://life.etro.vub.ac.be****
GIULIO CHIRIBELLA (invited) http://www.perimeterinstitute.ca****
PHILIP GOYAL (invited) http://www.philipgoyal.org/****
** **
Representation and Computationalism:****
GIULIO SANDINI (keynote) http://www.rbcs.iit.it****
JENNIFER HUDIN (invited) http://berkeley.edu****
HAROLD BOLEY (invited) http://www.cs.unb.ca/~boley****
** **
The AISB/IACAP World Congress programme, which serves both as the year's
AISB Convention and the year's IACAP conference, is honouring Alan Turing,**
and the broad and deep significance of Turing's work to AI, to the
philosophical ramifications of computing, and to philosophy and computing
in general.****
The Congress is one of the events forming the Alan Turing Year
** **
Even though Turing is best known for Turing machine and Turing test, his
contribution is significantly wider.****
He was among the first to pursue what Denning (2007) calls ?computing as
natural science?, and thus Hodges (1997) describes Turing as natural
?He thought and lived a generation ahead of his time, and yet the features
of his thought that burst the boundaries of the 1940s are better described
by the antique words: natural philosophy.?****
** **
The symposium addresses, but is not limited to, the following topics,
grouped in two tracks:****
** **
This track will address the emerging paradigm of natural computing, and its
philosophical consequences with different aspects including (but not
limited to):****
- Theoretical and philosophical view of natural computing/unconventional
computing with its philosophical significance (such as understanding of
computational processes in nature and in human mind).****
- Differences between conventional and unconventional computing.****
- Digital vs analog & discrete vs continuous computing****
- Recent advances in natural computation (as computation found in nature,
including organic computing; computation performed by natural materials and
computation inspired by nature)****
- Computation and its interpretation in a broader context of possible
frameworks for modeling and implementing computation.****
It is important to bring philosophical reflection into the discussion of
all the above topics.****
** **
This track highlights the relevance of the relationship between human
representation and machine representation to bring out the main issues
concerning the contrast between symbolic representation/processing on the
one hand and nature-inspired, non-symbolic forms of computation on the
other--with a special focus on connectionism. We also welcome work on
hybrids of symbolic and non-symbolic representations. Particular movements
that papers may wish to address are:****
-'Embedded, Embodied, Enactive' approach to cognitive science (from Varela
et al)****
-'Dynamic Systems' approach (from, say, Port and Van Gelder);****
- Other representational possibilities that are clearly available: no
representations or minimal representations;****
- Process/procedural representations (e.g. from Kevin O'Regan).****
** **
Paper submission deadline: February 1, 2012.****
Notification of acceptance: March 1, 2012.****
Camera ready version deadline: March 30, 2012.****
Symposium: 2nd ? 3rd July, 2012.****

Guidelines for paper submission are as follows:****
- The paper should be written in English.****
- The maximum length of a paper is 6 A4-sized pages in ECAI format (format
- The paper should be in PDF format.****
- Please choose one track between:****
   REPRESENTATION AND COMPUTATIONALISM and submit via the online paper
submission system at:****

Barry S Cooper****
Mark Burgin****
Bruce MacLennan****
Hector Zenil****
Koichiro Matsuno****
Vincent C. Müller****
William A Phillips****
Andree Ehresmann****
Leslie Smith****
Christopher D. Fiorillo****
Plamen Simeonov****
Marcin Schroeder****
Brian Josephson****
Shuichi Kato****
Walter Riofrio****
Craig A. Lindley****
Jordi Vallverdú****
Angela Ales Bello****
Gerard Jagers op Akkerhuis****
Harold Booley****
Cristophe Menant****
Rossella Fabbrichesi****
Giulio Chiribella****
Jennifer Hudin****
Philip Goyal****
Klaus Mainzer****

Gordana Dodig-Crnkovic, Mälardalen University, Sweden****
Raffaela Giovagnoli, Pontifical Lateran University, Vatican City****

There will be one session for system demonstrations, and one day poster

There will be a separate proceedings for each symposium, produced before
the Congress. Each delegate at the Congress will receive, on arrival, a
memory stick containing the proceedings of all symposia.****
Selected papers, under a second review process, will be considered for a
proceedings published by Cambridge Scholars Publishing and in the special
issue of the journal Entropy

The Congress serves both as the year's AISB Convention and the year's IACAP
conference. The Congress has been inspired by a desire to honour Alan
Turing, and by the broad and deep significance of Turing's work to AI, to
the philosophical ramifications of computing, and to Philosophy and
computing more generally. The Congress is one of the events forming the
Alan Turing Year (http://www.mathcomp.leeds.ac.uk/turing2012/).****
The intent of the Congress is to stimulate a particularly rich interchange
between AI and Philosophy on any areas of mutual interest, whether directly
addressing Turing's own research output or not.****
The Congress will consist mainly of a number of collocated Symposia on
specific research areas, interspersed with Congress-wide refreshment
breaks, social events and invited Plenary Talks. All papers other than the
invited Plenaries will be given within Symposia.****

For further inquiries please contact the symposium chairs:****
gordana.dodig-crnkovic at mdh.se  (Natural/ unconventional computing and its
philosophical significance)****
and raffa.giovagnoli at tiscali.it.(Representation and Computation)****


22) BCTCS: British Colloquium for Theoretical 
Computer Science, Manchester (U.K.), 2-5 April 2012


           British Colloquium for Theoretical Computer Science
                            Manchester, UK
                          2nd--5th April 2012

                        CALL FOR CONTRIBUTED TALKS

The 28th British Colloquium for Theoretical 
Computer Science will be hosted by the School of 
Computer Science, University of Manchester, from 2nd to 5th April, 2012.

The purpose of BCTCS is to provide a forum in 
which researchers in theoretical computer science 
can meet, present research findings, and discuss 
developments in the field. It also aims to 
provide an environment in which PhD students can 
gain experience in presenting their work, and 
benefit from contact with established 
researchers. This year, BCTCS is part of the Alan Turing Year, and will be
collocated with the Automated Reasoning Workshop 
ARW (http://arw2012.cs.man.ac.uk/).

The scope of the colloquium includes all aspects 
of theoretical computer science, including 
automata theory, algorithms, complexity theory, 
semantics, formal methods, concurrency, types, 
languages and logics. Both computer scientists 
and mathematicians are welcome to attend, as are 
participants from outside of the UK.

The colloquium features both invited and 
contributed talks. This year's invited speakers are

  Rod Downey, School of Mathematics, Statistics and Operations Research,
    Victoria University of Wellington. (LMS Keynote Speaker in
    Discrete Mathematics)
  Mike Edmunds, School of Physics and Astronomy, University of Cardiff.
  Reiner Haehnle, Fachbereich Informatik, Technische Universitaet Darmstadt.
  Nicole Schweikardt Institut fuer Informatik, Goethe-Universitaet,
    Frankfurt am Main.

Participants wishing to give 30 minute 
contributed talks may simply to submit a title 
and abstract (100--300 words) by the deadline given below.

Further details are available from the Colloquium website:
  http://bctcs2012.cs.manchester.ac.uk .

Important dates:

16th January 2012 --- Registration/accommodation booking opens.
19th March 2012 --- Abstract submission deadline for participants
                   wishing to give contributed talks.
2nd--5th April, 2012 --- Colloquium.

More information about the FOM mailing list