[FOM] CiE Newsletter No.50, September 21, 2011

Olivier Bournez bournez at lix.polytechnique.fr
Fri Sep 23 00:12:48 EDT 2011

CiE Newsletter No.50, September 21, 2011:

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


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.
(see also item 18)

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



     1) CiE 2012 Call for Papers
     2) LICS 2012 - Call for Workshop Proposals
     3) Postdoctoral position in classical and 
quantum computing, Paris (France), Deadline: 1 Nov 2011
     4) DICE 2012: Developments in Implicit 
Complexity, Tallinn (Estonia), 31 Mar - 1 Apr 2012
     5) 'The Incomputable' - Registration opens
     6) announcement Quantum Structures 2012
     7) 2nd CFP: The First Annual Conference on 
Complexity and Human Experience. Deadline: Jan 2, 2012
     8) CFP IJ Unconv. Comp. spc is. on New Worlds of Computation
     9) MAMLS Jan '12 -- Support available, 
lodging information -- second announcement
     11) Symposium on the occasion of Klaus Ambos-Spies' anniversary
     12) [CCC 0] Conference on Computational Complexity 2012: Call for Papers
     13) 2nd CfP: LATA 2012, A Coruna (Spain), 5-9 Mar 2012
     14) Modern Constructive Algebra, Besançon, France, 15-16 Oct 2011
     15) Call for applications - Best PhD Thesis 
of the Year in Computational Game Theory
     16) 2 postdoc positions (each 1 year) at Oxford (fwd)
     17) COPCOM 2011: Coping with Complexity, 
Cluj-Napoca (Romania), 19-20 October 2011
     18) COMPUTABILITY - The Journal of the Association CiE


1) CiE 2012 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:

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

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

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



2) LICS 2012 - Call for Workshop Proposals

                                        LICS 2012

        27th IEEE Symposium on Logic In Computer Science

	                    Call for Workshop Proposals

The 27th IEEE Symposium on Logic In Computer Science (LICS 2012)
will be held in Dubrovnik, Croatia, 25-28 June 2012.
Possible dates for workshops are Sunday 24 June and Friday 29 June
(i.e., one day before and one day after LICS).

Researchers and practitioners are invited to submit proposals for
workshops on topics relating logic - broadly construed - to computer
science or related fields. Typically, LICS workshops feature a number
of invited speakers and a number of contributed presentations. LICS
workshops do not produce formal proceedings. However, in the past
there have been special issues of journals based in part on certain
LICS workshops. Proposals should include:

* A short scientific summary and justification of the proposed
  topic. This should include a discussion of the particular benefits of
  the topic to the LICS community.

* A discussion of the proposed format and agenda.

* The proposed duration, which is typically one day (two-day
  workshops can be accommodated too).

* Your preferred dates.  This is important!

* Procedures for selecting participants and papers.

* Expected number of participants. This is important!

* Potential invited speakers.

* Plans for dissemination (for example, special issues of journals).

Proposals are due on the 21st November 2011 and should be
submitted via Easychair at

Notifications will be sent by the 15th December 2011. All accepted
workshops will be expected to have the programme ready by the
20th April 2012.

The workshop selection committee consists of the LICS
General Chair, LICS Workshop Co-Chairs, LICS 2012 PC Chair
and LICS 2012 Conference Co-chairs.

For more information contact the LICS workshop co-chairs
Adriana Compagnoni and Maribel Fernandez
at licsworkshops2012 at easychair.org


3) Postdoctoral position in classical and quantum 
computing, Paris (France), Deadline: 1 Nov 2011

The Algorithms and Complexity group of LIAFA (CNRS and University
Paris Diderot), Paris, France, is seeking excellent candidates for one
or more postdoctoral positions in classical and quantum computing.
Topics of interest include (but are not limited to): algorithms,
online algorithms, streaming algorithms, approximation algorithms,
communication complexity, cryptography, computational game theory,
quantum computing, computational applications of logic, randomness
in computing, privacy.

LIAFA is a joint laboratory of the CNRS (the French National Center
for Scientfic Research) and University Paris Diderot - Paris 7.
For more information  about LIAFA, please see http://www.liafa.jussieu.fr ,
and for more information about the Algorithms and Complexity group
please see http://www.liafa.jussieu.fr/algocomp .
Further information may be obtained from any of the permanent
members of the group.

To apply please send a CV, a summary of research and names of
at least three references to algocomp-apply at liafa.jussieu.fr .
For a starting date of January 2012 applications should be received by
November 1st, 2011.
For a starting date of September 2012 applications should be received by
February 1st, 2012.


4) DICE 2012: Developments in Implicit 
Complexity, Tallinn (Estonia), 31 Mar - 1 Apr 2012

                     FIRST CALL FOR PAPERS
                           DICE 2012
      3rd Workshop on Developments in Implicit Complexity
       Tallinn (Estonia), March 31st and April 1st, 2012

                  (Affiliated with ETAPS 2012)



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. polytime or
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 principles implying complexity properties.
This workshop focuses on ICC methods related to programs (rather
than descriptive methods). In this approach one relates complexity
classes to restrictions on programming paradigms (functional
programs, lambda calculi, rewriting systems), such as ramified
recurrence, weak polymorphic types, linear logic and linear types,
and interpretative measures. The two main objectives of this area
. to find natural implicit characterizations of various complexity
  classes of functions, thereby illuminating their nature and
. to design methods suitable for static verification of program

Therefore ICC is related on the one hand to the study of complexity
classes, and on the other hand to static program analysis. The
workshop will be open to contributions on various aspects of ICC
including (but not exclusively):
. 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,
. certification of complexity properties of programs,
. application of implicit complexity to other programming paradigms
  (e.g. imperative or object-oriented languages).

The first two DICE workshops were held in 2010 in Cyprus and in 2011
in Germany, both as part of ETAPS conferences. Before that, several
meetings on this topic had already been held with success in Paris
(WICC 2008), and Marseille (GEOCAL 2006 workshop on Implicit
computational complexity).


. Yuri Gurevich (Microsoft Research and University of Michigan)
. Ulrich Schoepp (LMU Munich)


The following deadlines are strict:

. Paper Submission (full papers): December 23rd, 2011;
. Notification (full papers): January 20th, 2012;
. Final Version (full papers): February 5th, 2012;
. Submission (extended abstracts): February 18th, 2012;
. Notification (extended abstracts): February 28th, 2012.

There will be two categories of submissions:
. Full papers, of up to 15 pages;
. Extended abstracts for short presentations (not included in the
  proceedings), of up to 3 pages.
Authors must indicate if their submission belongs to the second
category (by adding "(Extended Abstract)" in the title). Papers must
be submitted electronically, as pdf files, at the following
page: https://www.easychair.org/conferences/?conf=dice2012.
Submissions of the first category (full papers) should not have
been published before or submitted simultaneously to another
conference or journal. This restriction does not hold for the
second category (extended abstracts). Submissions of papers authored
by PC members are allowed and encouraged. Proceedings will be
published in EPTCS.


. Guillaume Bonfante (Nancy)
. Ugo Dal Lago (Bologna, chair)
. Marco Gaboardi (Bologna and UPenn)
. Nao Hirokawa (JAIST)
. Martin Hofmann (Munchen)
. Olivier Laurent (ENS Lyon)
. Jean-Yves Moyen (Paris Nord)
. Isabel Oitavem (Lisboa)
. German Puebla (Madrid)
. Simona Ronchi Della Rocca (Torino)


5) 'The Incomputable' - Registration opens

Registration is now open:

           June 12-15, 2012 - Turing Centenary Workshop on
                        "THE INCOMPUTABLE"
  at the Kavli Royal Society International Centre, Chicheley Hall, UK


THE INCOMPUTABLE is a major multidisciplinary workshop of the 6-month
Isaac Newton Institute programme - "Semantics and Syntax: A Legacy of Alan
Turing" (SAS).

It 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, philosophy and the wider
scientific world. It is held in association with the Turing Centenary
Conference (CiE 2012) in Cambridge the following week, which will run up
to the June 23rd centenary of Turing's birth, and the weekend of
celebrations in Cambridge, Manchester, Bletchley Park, and around the

There will be plenary talks from: Samson Abramsky, Martin Davis, Seth
Lloyd, Philip Maini, Yuri Matiyasevich, Istvan Nemeti/ Hajnal Andreka,
Gerald Sacks, Theodore A Slaman, Robert I Soare, Vlatko Vedral and Anton

Invited Special Session speakers include: Klaus Ambos-Spies, Marat M
Arslanov, Mark Bishop, Cristian Calude, Douglas Cenzer, Peter Cholak,
Jennifer Chubb, Bob Coecke, Jose Felix Costa, Vincent Danos, Rodney
Downey, Steven Ericsson-Zenith, Luciano Floridi, Sy Friedman, Sergey
Goncharov, Noam Greenberg, Joel Hamkins, Valentina Harizanov, Denis
Hirschfeldt, Mark Hogarth, Elham Kashefi, Julia Knight, Antonin Kucera,
Andrew Lewis, Giuseppe Longo, Antonio Montalban, Andre Nies, Mehrnoosh
Sadrzadeh, Richard A Shore, Aaron Sloman, Andrea Sorbi, Ivan Soskov,
Alexandra Soskova, Christof Teuscher, John Tucker, Jan van Leeuwen,
Kumaraswamy (Vela) Velupillai, Peter Wegner, Philip Welch, Jiri

There will be provision for informal discussions, small research
workshops, and project planning meetings.

THE INCOMPUTABLE, generously supported by the John Templeton Foundation,
promises to be a historic event, bringing the mathematical theory of
incomputability centre-stage once again. Attendance is limited to 120
participants - up to 60 accommodated on-site - so early registration is

The registration page is at:


Note: Speakers are already registered, and SAS participants have their own
arrangements, and should contact the Isaac Newton Institute directly, if
they have not already done so.

Organisers: S Barry Cooper and Mariya Soskova


6) announcement Quantum Structures 2012


Quantum Structures 2012 (IQSA 2012), the next biennial conference of the
International Quantum Structures Association,
will take place in Cagliari, Italy, 23-27 July 2012.
The proposed arrival date is Sunday, the 22th of July, and date of
departure is Saturday, the 28th of July.

The official call for papers and conference registration will be
distributed soon via the IQSA mailing list.
More information will be made available soon at the IQSA website:
and the conference website (coming soon).

Local organising committee:
Roberto Giuntini (Chair)
Maria Luisa Dalla Chiara, Hector Freytes, Antonio Ledda, Marco
Giunti, Francesco Paoli, Giuseppe Sergioli, Filippo Spanu.



7) 2nd CFP: The First Annual Conference on 
Complexity and Human Experience. Deadline: Jan 2, 2012

Subject: 2nd CFP: The First Annual Conference on Complexity and Human
    Experience. Deadline: Jan 2, 2012

Human Complexity 2012

The First Annual Conference on Complexity and Human Experience

Modeling Complexity in the Humanities and Social Sciences

May 30th ? June 1st, 2012

The University of North Carolina, Charlotte

The recent increase in the number of formal institutes and conferences
dedicated to complexity theory and its application is evidence that complexity
science has arrived and is realizing its potential to cut across almost every
academic discipline. Research projects centered on complex adaptive systems in
the natural (physics, chemistry, biology, etc.) and social sciences (economics,
political science, anthropology, sociology, psychology, etc.), along with novel
applications in engineering, computer science, robotics, and, more recently,
the arts and the humanities (archaeology, art history, history, literature,
philosophy, performance art, religion, etc.), have already earned some
recognition in the field of complexity science.

In light of these developments, the Complex Systems Institute
(http://www.complexity.uncc.edu) and the Center for Advanced Research in the
Humanities at the University of North Carolina, Charlotte (UNC Charlotte) will
inaugurate an annual conference series, beginning in 2012, dedicated to
complexity with particular application to understanding the intricacies of
human experience across all domains. The goal of the series is to provide a
trans-disciplinary venue for scholars from the humanities and the social
sciences, as well as some aspects of the natural sciences (such as
neuroscience, pharmacology, etc.). Since matters of life and death pertain to
human experience in profound and important ways, the conference hopes to
attract representatives from the allied health sciences as well.

The conference series will be dedicated to a particular topic each year. The
initial 2012 conference will be based on an Institute for Advanced Topics in
the Digital Humanities (IATDH) sponsored by the National Endowment for the
Humanities and the UNC Charlotte Complex Systems Institute this past year that
was dedicated to computer modeling in the humanities and social sciences. In
keeping with the theme of the IATDH, the topic for our first conference will
be: Modeling Complexity in the Humanities and Social Sciences.

Submissions are invited on any specific topic that falls within the parameters
described above. Sample topics include, but are not limited to, studies on:

*  The development and transmission of language
*  The propagation of beliefs, ideas and ideologies
*  The nature of historical and political change
*  The analysis of literary texts and their circulation
*  The effect of individual action on global economies
*  Social structure among pre-historic peoples
*  Archaeological settlement patterns in early cities
*  The role of architecture in facilitating public traffic patterns
*  The relationship between productivity, creativity, and happiness
*  Elements and measures of creativity
*  Discovery of early trends and indicators of social and economic change
*  The role of science and technology in enhancing human experience
*  Defining and measuring indicators of the quality of human experience
*  The relationship between organizational/societal structure and the flow of
    energy and information
*  Defining utility and efficacy in the context of human experience
*  Simulation and modeling tools and paradigms
*  Verification and validation of models and simulated systems
*  The relationship between healthcare providers, patients, Internet, and
    social media
*  Defining ontologies in the context of modeling and simulation
*  Languages and tools fro promoting trans- and inter-disciplinary
*  Human-technology interaction
*  Data-driven wellness initiatives

Submissions should be in the form of 5000-word papers, each of which will be
reviewed by the program committee. The committee is particularly interested in
papers that show novel applications of Complexity Theory to enhance research in
the areas here specified. Thus, preliminary work in progress or plans for a
research program are welcomed and encouraged.

Submission details will be posted to the conference website at
https://sites.google.com/site/humancomplexity2012/ in due time.

This conference is dedicated to the work of Alan Turing (1912-1954) as part of
the 2012 Alan Turing Year (http://www.turingcentenary.eu/), a series of events
to commemorate Turing's life and work. We do so here by examining computing
applications and complexity in the humanities and social sciences that allow us
to discover, create and make connections in ways that would not be possible
were it not for Turing's seminal work. The conference will begin with a
presentation on the life and times of the man who provided the theory that made
the modern computer possible.

Human Complexity 2012 is sponsored in part by the International Association for
Computing and Philosophy (http://iacap.org).

Submission Deadline: January 2nd, 2012 (Firm)

Decision Date: February 1st

Final Program: March 1st

Conference Chairs (in alphabetical order):

*  Anthony Beavers (Director, Cognitive Science and the Digital Humanities
    Lab, University of Evansville)
*  Mirsad Hadzikadic (Director, The Complexity Institute, UNC Charlotte)
*  Paul Youngman (Director, Center for Advanced Research in the Humanities,
    UNC Charlotte)

Organizing Committee:

*  Anthony Beavers (Director, Cognitive Science and the Digital Humanities
    Lab, University of Evansville)
*  Marvin Croy (Chair, Department of Philosophy, UNCC)
*  Patrick Grim (Professor of Philosophy, SUNY-Stony Brook)
*  Mirsad Hadzikadic (Director, The Complexity Institute, UNC Charlotte)
*  Paul Youngman (Director, Center for Advanced Research in the Humanities,
    UNC Charlotte)

Program Committee (preliminary):

*  Anthony Beavers (University of Evansville)
*  Aaron Bramson (University of Michigan)
*  Ted Carmichael (UNC Charlotte)
*  Marvin Croy (UNC Charlotte)
*  Patrick Grim (SUNY-Stony Brook)
*  Mirsad Hadzikadic (UNC Charlotte)
*  Sonya Hardin (UNC Charlotte)
*  Nicolas Payette (Université du Québec à Montréal)
*  Dan Singer (University of Michigan)
*  Charles Turnitsa (Old Dominion University)
*  Paul Youngman (UNC Charlotte)

Anthony F. Beavers, Ph.D.
Professor of Philosophy
Director of Cognitive Science and the Digital Humanities Laboratory
The University of Evansville

President, International Association for Computing and Philosophy


8) 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 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
    * 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 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 16th 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), projet Graphes
et Algorithmes
Université d'Orléans - logo Université d'Orléans, Département
d'Informatique de l'UFR Sciences.


9) MAMLS Jan '12 -- Support available, lodging 
information -- second announcement


What: Mid-Atlantic Mathematical Logic Seminar
When: F Jan. 13 (about 2 pm) - Sun Jan. 15, 2012 (about 2 pm)
Where: Deerfield Beach, FL, hosted by Florida Atlantic University
Website: http://math.fau.edu/richman/FAU2012.html

Special theme: Dedicated to Alan Turing as part of Alan Turing Year (see
http://www.mathcomp.leeds.ac.uk/turing2012/), commemorating the centenary of
his birth.
Program: There will be a special session dedicated to Turing's life and
times, which will include an address by his famed biographer David Leavitt,
as well as other surprises. The speakers for the scientific part will
include Wesley Calvert, Martin Davis, Damir Dzhafarov, Joel Hamkins, Pietr
Hofstra, Russell Miller, Anil Nerode, Gerald Sacks, Andre Scedrov, Wilfried
Sieg, and Robert Soare.

Money: Some funding is available to support attendance at the meeting. We
are most interested in supporting young researchers and members of groups
typically underrepresented in the sciences. Of course everyone is welcome to
apply, which you can do by writing me at Lubarsky.Robert at comcast.net. Please
include in your request a brief professional biography, as well as a short
description of why your attendace at the conference would be useful to
yourself or the community. (Please do not be put off by this request for
information! In case demand is great, I need some basis on which to make
decisions, so I need to know who you are. I have to give the money away one
way or another, so apply.)

Lodging: You can now make your hotel reservations for the meeting. Such a
reservation is subject to availability, so call soon. This is Florida in
season, after all. The talks will be held at the Wyndham Deerfield Beach,
http://www.wyndhamdeerfieldresort.com/, which is offering rooms to
conference attendees at the special rate of $189/night for oceanfront,
$159/night for city view, subject to availability, up to Dec. 12. For this
beachfront property in season, take my word for it that this is a good deal.
To make a reservation, call 954-428-2850 or toll free 24 hours (800)
426-0084 and mention MAMLS to get the special rate. Online reservations are
not possible. Alternatively, you could stay at the Comfort Inn Oceanside,
http://comfortinnoceanside.com/, just a few blocks away, for prices ranging
from $119.95 to $149.95/night, subject to availability, up to Dec. 11. For
reservations, call (954) 428-0650 or toll free 866-86-OCEAN and mention
MAMLS to get the special rate. If you would like to save even more by
rooming with somebody, drop me a line at Lubarsky.Robert at comcast.net and I
will act as a clearinghouse for such requests. Please remember, this is in
season, so I encourage you to do this at your earliest convenience, as
either hotel might eventually get sold out. This is especially important if
you want to make a vacation out of this and come early or stay late
(remember, M Jan 16 is MLK Day), as space at the special rate is limited.

Transportation: Transportation information is at the hotel websites. The
closest airports are, in order of increasing distance from the hotel, Ft.
Lauderdale/Hollywood, Palm Beach, and Miami. From any of those airports, you
could take the shuttle, a cab, or the train (http://www.tri-rail.com/) to
the Deerfield Beach station and a cab from there.

For questions: Lubarsky.Robert at comcast.net.





The 5th Edition of the Reachability Problems Workshop
September 28 - 30, 2011
Genova, Italy
webpage: http://rp11.disi.unige.it/


The Reachability Workshop is specifically aimed at gathering together
scholars from diverse disciplines and backgrounds 
interested in reachability problems
that appear in Algebraic structures, 
Computational models, Hybrid systems, Logic,
and Verification.

Topics of interest include: Reachability problems in infinite state
systems, rewriting systems, dynamical and hybrid 
systems; reachability problems in logic
and verification; reachability analysis in 
different computational models, counter/ timed/ cellular/
communicating automata; Petri-Nets; computational 
aspects of algebraic structures (semigroups, groups and
rings); frontiers between decidable and 
undecidable reachability problems; predictability in
iterative maps and new computational paradigms.

Previous RP editions took place in Brno (Czech Republic, 2010),
Palaiseau (France, 2009), Liverpool (UK, 2008),
Turku (Finland, 2007).

The fifth edition will be held in Genova, a historic city in Liguria, Italy.


Krishnendu Chatterjee, IST Austria
Graph Games with Reachability Objectives: Mixing Chess, Soccer and Poker

Bruno Courcelle, Labri, Universitè Bordeaux 1
Automata for monadic second-order model-checking

Joost-Pieter Katoen, RWTH Aachen
Timed Automata as Observers of Stochastic Processes

Jean-Francois Raskin, CFV, Universitè Libre de Bruxelles
Reachability Problems for Hybrid Automata


Monotonic Abstraction for Programs with Multiply Pointed Structures
Jonathan Cederberg, Parosh Abdulla and Tomas Vojnar

A new weakly universal cellular automaton in the 3D hyperbolic space
with two states
Maurice Margenstern

Reachability for Finite-State Process Algebras Using Static Analysis
Nataliya Skrypnyuk and Flemming Nielson

A fully symbolic bisimulation algorithm
Malcolm Mumme and Gianfranco Ciardo

Lower bounds for the length of reset words in eulerian automata
Vladimir Gusev

Automated Termination in Model Checking Modulo Theories
Alessandro Carioni, Silvio Ghilardi and Silvio Ranise

Parametric Verification and Test Coverage for Hybrid Automata Using the
Inverse Method
Fribourg Laurent and Ulrich Kuehne

Characterizing Conclusive Approximations by Logical Formulae
Yohan Boichut, Thi-Bich-Hanh Dao and Valerie Murat.

Synthesis of Timing Parameters Satisfying Safety Properties
Etienne Andre' and Romain Soulat

Decidability of LTL Model Checking for Vector Addition Systems with one
Remi Bonnet

Completeness of the Bounded Satisfiability Problem for Constraint LTL
Marcello M. Bersani, Achille Frigeri, Matteo Rossi and Pierluigi San Pietro

Reachability and deadlocking problems in multi-stage scheduling
Christian Eggermont and Gerhard J. Woeginger

Improving Reachability Analysis of Infinite State Systems by Specialization
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti and Valerio Senni

Formal Language Constrained Reachability and Model Checking
Propositional Dynamic Logics
Roland Axelsson and Martin Lange

Complexity Analysis of the Backward Coverability Algorithm for VASS
Laura Bozzelli and Pierre Ganty

Efficient Bounded Reachability Computation for Rectangular Automata
Xin Chen, Erika Abraham and Goran Frehse

The preliminary program is available at the RP webpage


The early registration deadline is 31st of July.

Early (until July 31)
Regular fee    200    250
Student fee    150    200

Late (after July 31): +50


September is a very busy period in Genova (there are several other
conferences and events right before and after RP). We have an option for
a limited number of rooms in the hotels in the city center.  Our
University can also offer (a limited number of) accomodations in Casa
Paganini (student residence) at very convenient prices.
Travel information and on-line registration/booking forms are available
under the RP webpage:


For further information, please contact the RP 2011 organizers:

Giorgio Delzanno: delzanno at disi.unige.it
Igor Potapov: potapov at liverpool.ac.uk


11) Symposium on the occasion of Klaus Ambos-Spies' anniversary

Dear Sir or Madam,

Klaus Ambos-Spies' 60th birthday in November is approaching. On the
occasion of his anniversary, a two-day symposium "Degrees and Randomness"
will be held in Heidelberg on 3 and 4 February, 2012.

For details see below or the preliminary web page for the meeting at
http://math.uni-heidelberg.de/logic/e_aktuelles.html .

Further information will be provided in due course and you are welcome to
inquire with the members of the local organizing committee at any time.

We are looking forward to seeing many of you in Heidelberg in February.


Felicitas Hirsch, Thorsten Kraeling and Wolfgang Merkle

(Members of the local organizing committee).

Degrees and Randomness

A Meeting in Honor of Klaus Ambos-Spies
on the occasion of his 60th birthday

held at the University of Heidelberg
on Friday 3 February and Saturday 4 February, 2012

Confirmed Invited Speakers:

Paul Fischer, Lingby
Steffen Lempp, Madison
Manuel Lerman, Storrs
André Nies, Auckland
Richard A. Shore, Cornell
Frank Stephan, Singapore
Sebastiaan A. Terwijn, Nijmegen

The meeting will be held on the premises of the Mathematics Department of
the University of Heidelberg.

The meeting will start on Friday afternoon and will comprise a social
dinner on Friday night.


Felicitas Hirsch
Institute of Computer Science
University of Heidelberg
Im Neuenheimer Feld 294
D-69120 Heidelberg
Phone: +49 (0)6221 54-8204
Fax: +49 (0)6221 54-4465 /
Email: logic at math.uni-heidelberg.de


12) [CCC 0] Conference on Computational Complexity 2012: Call for Papers

Submission Deadline: Thursday, December 8, 2011, 19:59 EST


The conference seeks original research papers in all areas of
computational complexity theory, studying the absolute and relative power
of computational models under resource constraints. We also encourage
results from other areas of computer science and mathematics motivated by
topics in complexity theory. The following list of sample topics is not

Complexity classes, Algebraic complexity, Proof complexity, Interactive
and probabilistic proof systems, Circuit complexity, Kolmogorov
complexity, Logic and descriptive complexity, Average case complexity,
Reducibility and completeness, Communication complexity, Complexity in
other concrete computational models, Cryptographic complexity, Complexity
of optimization and inapproximability, Complexity and learning,
Complexity and coding theory, Pseudorandomness and derandomization,
Complexity and sub-linear computation, Quantum computation


The 2012 conference will be held from June 26th to June 29th, 2012, in
Porto, Portugal, and is organized in association with the 2012 Alan
Turing Year. In order to defray the costs of attending an overseas
conference, some travel awards are available for students from US
institutions. More information about travel and local arrangements will
be made available on the conference webpage in due time.

The conference is sponsored by the IEEE Computer Society Technical
Committee for Mathematical Foundations of Computing in cooperation with
the ACM Special Interest Group on Algorithms and Computation Theory
(SIGACT) and the European Association of Theoretical Computer Science
(EATCS). The National Science Foundation (NSF) provides student travel
support through award CCF-1143914.

Papers must be submitted electronically, and received by December 8th,
2011, 19:59 EST, for consideration. The submission server will be active
a few weeks before the submission deadline. Notification of acceptance
will be sent by February 17th, 2012, and final camera-ready copies of
accepted papers will be due around mid-March 2012.

Submission format:

A submission should consist of a title page (containing the title, author
names and affiliations, and an abstract of 1-2 paragraphs summarizing the
paper's contributions), a body of no more than 10 pages, a bibliography,
and possible appendices. The paper should be in single-column format, use
at least 11-point font, and have standard margins and spacing between
lines. Submissions deviating from these guidelines risk summary rejection
without consideration of their merits.

The body of the paper should (i) explain what the major contributions
are, (ii) convey why they are interesting, (iii) discuss how they relate
to prior work, and (iv) present the main ideas behind them. Authors are
expected to include all ideas necessary for an expert to fully verify the
central claims in the paper, and may use appendices to substantiate
technical claims as needed. The appendices will be read at the discretion
of the Program Committee. (Authors may, if they prefer, simply attach a
copy of the full paper as the appendix.)

All submissions will be treated as confidential, and will only be
disclosed to the committee and their chosen sub-referees. The
instructions for the format of final copies will be communicated to the
authors of accepted papers.

Simultaneous submission policy:

Material which has been previously published in a journal or another
conference proceedings, or which is scheduled for publication prior to
July, 2012, will not be considered for acceptance.  Simultaneous
submission of the same or essentially the same material to another
conference with published proceedings is not allowed.

Online posting:

Authors are encouraged to post full versions of their submissions in a
freely accessible on-line repository such as the Electronic Colloquium on
Computational Complexity or the arXiv. It is hoped that authors of
accepted papers will make full versions of their papers, with proofs,
available by the camera-ready deadline. (This should be done in a manner
consistent with the IEEE Copyright Policy.)

Presenting the work:

Authors of accepted papers are expected to present their work at the
conference. The program committee will determine time allocations for
presentations (between 15 and 45 minutes). Conference proceedings will be
published by the IEEE Computer Society. Publication in the conference
proceedings does not preclude subsequent journal publication.

Ronald V. Book Prize for Best Student Paper:

This award will be given to the best paper written solely by one or more
students. An abstract is eligible if all authors are full-time students
at the time of submission. This should be indicated in the submission
registration message or cover letter. The program committee may decline
to make the award or may split it among several papers.

Best Paper Award:

This award will be given to the best paper submitted to the conference.
This will be awarded by the program committee. The program committee may
decline to make the award or may split it among several papers.


Eric Allender, Rutgers University
Boaz Barak, Microsoft Research New England
Irit Dinur, Weizmann Institute
Nicola Galesi, University of Rome "La Sapienza"
Venkatesan Guruswami (chair), Carnegie Mellon University
Neeraj Kayal, Microsoft Research India
Julia Kempe, Univ. of Paris 7 and Tel Aviv University
Hartmut Klauck, Nanyang Technological University
Rahul Santhanam, University of Edinburgh
Rocco Servedio, Columbia University
Amir Yehudayoff, Technion

Local Arrangement Chair: Luis Antunes (Porto University)

Publicity Chair: Richard Beigel (Temple University)

Conference website: computationalcomplexity.org


13) 2nd CfP: LATA 2012, A Coruna (Spain), 5-9 Mar 2012

2nd Call for Papers


LATA 2012

A Coruña, Spain

March 5?9, 2012



LATA is a yearly conference in theoretical 
computer science and its applications. Following the tradition
of the International Schools in Formal Languages 
and Applications developed at Rovira i Virgili University
in Tarragona since 2002, LATA 2012 will reserve 
significant room for young scholars at the beginning of
their career. It will aim at attracting 
contributions from both classical theory fields and application areas
(bioinformatics, systems biology, language 
technology, artificial intelligence, etc.).


LATA 2012 will take place in A Coruña, at the 
northwest of Spain. The venue will be the Faculty of
Computer Science, University of A Coruña.


Topics of either theoretical or applied interest 
include, but are not limited to:

? algebraic language theory
? algorithms for semi?structured data mining
? algorithms on automata and words
? automata and logic
? automata for system analysis and programme verification
? automata, concurrency and Petri nets
? automatic structures
? cellular automata
? combinatorics on words
? computability
? computational complexity
? computational linguistics
? data and image compression
? decidability questions on words and languages
? descriptional complexity
? DNA and other models of bio?inspired computing
? document engineering
? foundations of finite state technology
? foundations of XML
? fuzzy and rough languages
? grammars (Chomsky hierarchy, contextual, 
multidimensional, unification, categorial, etc.)
? grammars and automata architectures
? grammatical inference and algorithmic learning
? graphs and graph transformation
? language varieties and semigroups
? language?based cryptography
? language?theoretic foundations of artificial intelligence and artificial life
? parallel and regulated rewriting
? parsing
? pattern recognition
? patterns and codes
? power series
? quantum, chemical and optical computing
? semantics
? string and combinatorial issues in computational biology and bioinformatics
? string processing algorithms
? symbolic dynamics
? symbolic neural networks
? term rewriting
? transducers
? trees, tree languages and tree automata
? weighted automata


LATA 2012 will consist of:

? 3 invited talks
? 2 invited tutorials
? peer?reviewed contributions


Eugene Asarin (Paris 7)
Bernard Boigelot (Liège)
Gilles Dowek (INRIA), tutorial
Rodney Downey (Wellington), tutorial
Jack Lutz (Iowa State)


Eric Allender (Rutgers)
Miguel Á. Alonso (A Coruña)
Amihood Amir (Bar?Ilan)
Dana Angluin (Yale)
Franz Baader (Dresden)
Patricia Bouyer (Cachan)
John Case (Delaware)
Volker Diekert (Stuttgart)
Paul Gastin (Cachan)
Reiko Heckel (Leicester)
Sanjay Jain (Singapore)
Janusz Kacprzyk (Warsaw)
Victor Khomenko (Newcastle)
Bakhadyr Khoussainov (Auckland)
Claude Kirchner (Paris)
Maciej Koutny (Newcastle)
Gregory Kucherov (Marne?la?Vallée)
Salvador Lucas (Valencia)
Sebastian Maneth (Sydney)
Carlos Martín?Vide (Tarragona, chair)
Giancarlo Mauri (Milano Bicocca)
Aart Middeldorp (Innsbruck)
Faron Moller (Swansea)
Angelo Montanari (Udine)
Joachim Niehren (Lille)
Mitsunori Ogihara (Miami)
Enno Ohlebusch (Ulm)
Dominique Perrin (Marne?la?Vallée)
Alberto Policriti (Udine)
Alexander Rabinovich (Tel Aviv)
Mathieu Raffinot (Paris)
Jörg Rothe (Düsseldorf)
Olivier H. Roux (Nantes)
Yasubumi Sakakibara (Keio)
Eljas Soisalon?Soininen (Aalto)
Frank Stephan (Singapore)
Jens Stoye (Bielefeld)
Howard Straubing (Boston)
Masayuki Takeda (Kyushu)
Wolfgang Thomas (Aachen)
Sophie Tison (Lille)
Jacobo Torán (Ulm)
Tayssir Touili (Paris)
Esko Ukkonen (Helsinki)
Frits Vaandrager (Nijmegen)
Manuel Vilares (Vigo)
Todd Wareham (Newfoundland)
Pierre Wolper (Liège)
Hans Zantema (Eindhoven)
Thomas Zeugmann (Sapporo)


Miguel Á. Alonso (A Coruña, co?chair)
Adrian Horia Dediu (Tarragona)
Carlos Gómez Rodríguez (A Coruña)
Jorge Graña (A Coruña)
Carlos Martín?Vide (Tarragona, co?chair)
Bianca Truthe (Magdeburg)
Jesús Vilares (A Coruña)
Florentina Lilica Voicu (Tarragona)


Authors are invited to submit papers presenting 
original and unpublished research. Papers should not
exceed 12 single?spaced pages (including eventual 
appendices) and should be formatted according to
the standard format for Springer Verlag's LNCS series (see
Submissions have to be
uploaded at:



A volume of proceedings published by Springer in 
the LNCS series will be available by the time of the

A special issue of a major journal will be later 
published containing peer?reviewed extended versions of
some of the papers contributed to the conference. 
Submissions to it will be by invitation.


The period for registration will be open since 
July 16, 2011 until March 5, 2012. The registration form
can be found at the website of the conference: 

Early registration fees: 500 Euro
Early registration fees (PhD students): 400 Euro
Late registration fees: 540 Euro
Late registration fees (PhD students): 440 Euro
On?site registration fees: 580 Euro
On?site registration fees (PhD students): 480 Euro

At least one author per paper should register. 
Papers that do not have a registered author who paid the
fees by December 5, 2011 will be excluded from the proceedings.

Fees comprise access to all sessions, one copy of 
the proceedings volume, coffee breaks and lunches.
PhD students will need to prove their status on site.


Early (resp. late) registration fees must be paid 
by bank transfer before December 5, 2011 (resp.
February 24, 2012) to the conference series 
account at Uno?e Bank (Julián Camarillo 4 C, 28037 Madrid,

IBAN: ES3902270001820201823142 ? Swift/BIC code: 
UNOEESM1 (account holder: Carlos Martin?Vide ?
LATA 2012; account holder?s address: Av. 
Catalunya, 35, 43002 Tarragona, Spain).

Please write the participant?s name in the 
subject of the bank form. Transfers should not involve any
expense for the conference. People claiming early 
registration will be requested to prove that they gave
the bank transfer order by the deadline.

On?site registration fees can be paid only in 
cash. A receipt for payments will be provided on site.

Besides paying the registration fees, it is 
required to fill in the registration form at the website of the


Paper submission: October 7, 2011 (23:59h, CET)
Notification of paper acceptance or rejection: November 18, 2011
Final version of the paper for the LNCS proceedings: November 27, 2011
Early registration: December 5, 2011
Late registration: February 24, 2012
Starting of the conference: March 5, 2012
Submission to the post?conference special issue: June 9, 2012


florentinalilica.voicu at urv.cat


LATA 2012
Research Group on Mathematical Linguistics
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34?977?559543
Fax: +34?977?558386


14) Modern Constructive Algebra, Besan�on, France, 15-16 Oct 2011


Modern Constructive Algebra - Dedicated to Henri Lombardi

      Workshop, Laboratoire de Mathématiques de
      Besançon, France, 15-16 October 2011



     * María Emilia Alonso García (Spain)
     * Thierry Coquand (Sweden)
     * André Galligo (France)
     * Hajime Ishihara (Japan)
     * Alban Quadrat (France)
     * Claude Quitté (France)
     * Fred Richman (USA)
     * Ihsen Yengui (Tunisia)

Organisers: Stéphane Chrétien, Stefan Neuwirth, Hervé Perdry,
             Marie-Françoise Roy, Peter Schuster.

Registration: by email to      stefan.neuwirth at univ-fcomte.fr



15) Call for applications - Best PhD Thesis of 
the Year in Computational Game Theory

Please pass this on.

Graduate Student Contest - call for applications- first announcement

Best PhD Thesis Project of the Year in Computational Game Theory


Sponsor: John Templeton Foundation

Deadline for submitting PhD Theses summaries:
October 15, 2011, at gametheory at rist.ro.

Applicants: Intended applicants are PhD students in the field of
Computational Game Theory. PhD students in the final stage of their
Thesis or who have recently defended their thesis are eligible.
Hopefully, this contest will spot the most insightful and original
recent work in Computational Game Theory. Healthy competition between
PhD students and the emergence of new, bold, ideas is encouraged.

Monetary amount: 1st prize - 1000 EUR,
                 2nd prize - 700 EUR,
                 3rd prize - 500 EUR.



16) 2 postdoc positions (each 1 year) at Oxford (fwd)

From: Bob Coecke
To: "quantum-foundations at maillist.ox.ac.uk"

Subject: [quantum-foundations] 2 postdoc positions (each 1 year) at Oxford

Two postdoc positions are advertised in the approximately 30 member
quantum group, led by Samson Abramsky and Bob Coecke:
The group has a has a multidisciplinary research activity including the
areas of quantum foundations and quantum computation, category theory,
computer science logic and AI including computational linguistics.

The applicants are expected to contribute to one of the ongoing research
strands within the group. One of the successful candidates is expected to
contribute to the development of quantum reasoning software, and its
exploitation in quantum foundations and quantum information.  Given
constraints regarding visas etc., the aimed startdate is October 1st.

Further particulars can be found here:


17) COPCOM 2011: Coping with Complexity, 
Cluj-Napoca (Romania), 19-20 October 2011


First International Conference on Coping with Complexity
October 19, Cluj-Napoca, Romania


The Center for the Study of Complexity from Babes-Bolyai University
(http://csc.centre.ubbcluj.ro) and the Romanian Institute for Science and
Technology (http://www.rist.ro) cordially invite scientists and
researchers over the vast field of Complexity to exchange ideas within the
first edition of the Coping with Complexity Conference (COPCOM) in
Cluj-Napoca, on October 19-20, 2011.

COPCOM aims at opening a dialogue between international researchers and
practitioners from different disciplines related to the study of
complexity. As complexity is a term with different connotations in various
fields of science, COPCOM aims to be an highly interdisciplinary forum to
discuss specific approaches in coping with complexity, covering a wide
area of topics.

We invite submissions presenting significant advances in Complexity in the
form of:
+ full-length research papers,
+  abstracts (up to two pages)

Submitted papers will undergo a peer review process. Selection criteria
will be based on relevance, originality, significance, impact, technical
soundness and quality of the presentation. Contributions are expected to
provide original results, insights and theoretical and/or experimental
innovations. Full-length papers must be in PDF, not exceeding 12 pages and
conforming to the Latex template at the Springer's Instructions for
Authors page. Contributions (both full-length and abstracts) are welcome
through the system available at


A booklet with the abstracts/full versions will be distributed at the
conference. Full version of all accepted papers will be invited
post-conference for publication in one of the following journals:

Studia Universitas Babes-Bolyai, Series Informatica
(http://cs.ubbcluj.ro/~studia-i/) and

International Journal of Unconventional Computing

Topics of interest are (not limited to):

Philosophical and Computational aspects of Complexity
Metaheuristics and Complexity
Complex Networks
Complexity in Engineering
Complexity in Sociology and Economics
Models of economic and technological dynamics
Models of Social Dynamics
Combinatorial Optimization and Computational Complexity
Unconventional Computing
Physics and Society
Disordered Systems
Complexity in Natural Sciences
Arts, Humanities and Complexity


Deadline for submission: August, 15
Notification of acceptance: September, 1
Deadline for camera-ready: September, 15

REGISTRATION is free of charge but required, by email at
complexity2011 at cs.ubbcluj.ro (Deadline: September 15)

ACKNOWLEDGMENT: This event is made possible through the support of a grant
from the John Templeton Foundation. The opinions expressed in this
conference are those of the authors and do not necessarily reflect the
views of the John Templeton Foundation.


Please note that COPCOM 2011, a free event, is colocated with NICSO 2011
(fifth edition of the International Workshop on Nature Inspired
Cooperative Strategies for Optimization).


Opportunities for joint attendance of the two conferences will be provided.



18) COMPUTABILITY - The Journal of the Association CiE


The Journal of the Association CiE

Now Accepting Submissions!

First volume to be published in 2012
as part of the celebrations of the Alan Turing Year


Aims and Scope

Computability is the journal of the Association Computability in Europe
and it is published by IOS Press in Amsterdam.

The journal Computability is a peer reviewed international journal that
is devoted to publishing original research of highest quality, which is
centered around the topic of computability.

The subject is understood from a multidisciplinary perspective,
recapturing the spirit of Alan Turing (1912-1954) by linking theoretical
and real-world concerns from computer science, mathematics, biology,
physics, computational neuroscience, history and the philosophy of


Vasco Brattka (Cape Town, South Africa)

Managing Editors

Paola Bonizzoni (Milan, Italy)
S. Barry Cooper (Leeds, UK)
Benedikt Loewe (Amsterdam, The Netherlands)
Elvira Mayordomo (Zaragoza, Spain)

Editorial Board

Samson Abramsky (Oxford, UK)
Manindra Agrawal (Kanpur, India)
Eric Allender (Piscataway, USA)
Jeremy Avigad (Pittsburgh, USA)
Arnold Beckmann (Swansea, UK)
Olivier Bournez (Palaiseau, France)
Alessandra Carbone (Paris, France)
Karine Chemla (Paris, France)
Bruno Codenotti (Pisa, Italy)
Stephen A. Cook (Toronto, Canada)
Anuj Dawar (Cambridge, UK)
Rodney G. Downey (Wellington, New Zealand)
Natasha Jonoska (Tampa, USA)
Ulrich Kohlenbach (Darmstadt, Germany)
Russell Miller (New York, USA)
Andrei Morozov (Novosibirsk, Russia)
Prakash Panangaden (Montreal, Canada)
Frank Stephan (Singapore)
Vlatko Vedral (Oxford, UK)
Rineke Verbrugge (Groningen, The Netherlands)
Ning Zhong (Cincinnati, USA)

Submission Guidelines

The journal Computability invites submission of full papers of highest
quality on all research topics related to computability.

Computability accepts only submissions of original research papers that
have not been published previously and that are not currently submitted
elsewhere. Full versions of papers that have already been published in
conference proceedings are eligible only if the conference version is
clearly cited and the full version enhances the conference version

Authors are requested to submit PDF manuscripts electronically via the
online submission system. Authors can indicate non-binding wishes
regarding Editorial Board Members who should handle their submission.
Final versions of accepted papers have to be prepared using the journal
style file and they need to be submitted together with all source files.

Authors submitting a manuscript do so on the understanding that they
have read and agreed to the terms of the IOS Press Author Copyright
Agreement and that all persons listed as authors have given their
approval for the submission of the paper.



More information about the FOM mailing list