[FOM] CiE Newsletter No.51, October 19, 2011

Olivier Bournez bournez at lix.polytechnique.fr
Wed Oct 19 19:20:46 EDT 2011

CiE Newsletter No.51, October 19, 2011:

Please send any items you would like included in 
next letter to Olivier Bournez (bournez at lix.polytechnique.fr)
DEADLINE: November 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.

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


	•	1) Workshop on Complex Systems as Computing  Models (WCSCM2011)
	•	2) Presburger Award 2012 - Call for Nominations
	•	3) Logical Approaches to Barriers in Complexity  II 26 - 30 March 2012
	•	4) 17th International Conference 
on  Implementation and Application of Automata CIAA 2012 cfp
	•	5) BOOK ANNOUNCEMENT: Published 2011 in 
the  CiE/Springer book series "Theory and Applications of Computability"
	•	6) CSR 2012: 1st CfP
	•	7) LPAR-18 Call for Papers and Workshops
	•	8) DCM 2012: Developments in 
Computational  Models, Cambridge (U.K.), 17 June 2012
	•	9) COMPUTING 2011 - Symposium on 75 Years 
of  Turing Machine and Lambda-Calculus
	•	10) TAMC 2012, MAY 16-21: CALL FOR PAPERS
	•	11) Call for Workshop Proposals: LICS 
2012,  Dubrovnik (Croatia), 25-28 June 2012
	•	12) International Conference on the History 
and  Philosophy of Computing, Gent (Belgium), 7-10 Nov 2011


1) Workshop on Complex Systems as Computing Models (WCSCM2011)

(From H. Zenil)

Workshop on Complex Systems as Computing Models (WCSCM2011)
November 9-10, 2011
Centro de Ciencias de la Complejidad, UNAM
Instituto de Ciencias Nucleares, UNAM
Mexico City
(in collaboration with LCCOMP, LABORES, and ICUC)

The "Workshop on Complex Systems as Computing 
Models" is an international meeting focusing in 
the results of complex systems, non-linear media, 
and dynamical systems as models of computation. 
The workshop aims to bring together researchers 
who are currently developing new models based in 
the manipulation and control of complex systems 
to perform computation and contributing to the 
understanding of the concept of computation 
itself. Examples of this paradigm are 
reaction-diffusion computers, cellular automata 
(such as the game of Life and rule 110), 
DNA-computers, physics of computation, 
bio-molecular computing, quantum computing, 
cellular neural networks, competing patterns 
computing, tiling computing, origami computing, 
unconventional computing, and natural inspired 
computation. The goal is to foster interaction 
and provide a forum for presenting new ideas and 
work in progress to enable researchers in the 
field and related fields to learn about current 
and future activities of the community in this 
promising area in development. WCSCM2011 will be 
a meeting with presentations both in Spanish and 
English with submissions also accepted both in 
Spanish and English (with preference in Spanish).

Plenary speakers -------------------
	•	Prof. Kenichi Morita Hiroshima University, Japan
	•	Dr. Salvador Elías Venegas Andraca TEC  Monterrey, Mexico
Publication -------------------

A selected number of papers will be published in 
a volume published by Luniver Press edited by 
Genaro J. Martinez, Hector Zenil and Christopher R. Stephens.

Program committee ---------------------
	•	Genaro J. Martinez, C3, ICN, UNAM. U. of the  West of England.
	•	Hector Zenil, C3 UNAM. Paris 1. U. of Sheffield.  Wolfram Research.
	•	Christopher R. Stephens, C3, ICN, UNAM.
For more details, please visit the WCSCM2011 
website. WCSCM2011 is supported and organized by 
the Centro de Ciencias de la Complejidad (C3), 
Instituto de Ciencias Nucleares (ICN), 
Laboratorio de Ciencias de la Computacion 
(LCCOMP) of the Universidad Nacional Autonoma de 
Mexico (UNAM), Mexico. The Laboratoire de 
Recherche Scientifique (LABORES), France. The 
International Centre of Unconventional Computing 
(ICUC) of the University of the West of England (UWE), UK.


2) Presburger Award 2012 - Call for Nominations

   Presburger Award for Young Scientists

    Call for Nominations

    Deadline: December 31st, 2011

    Starting in 2010, the European Association of 
Theoretical Computer Science (EATCS) established
    the Presburger Award, conferred annually at 
the International Colloquium on Automata, Languages
    and Programming (ICALP) to a young scientist 
(in exceptional cases to several young scientists) for
    outstanding contributions in theoretical 
computer science, documented by a published paper or a
    series of published papers.

    The Award is named after Mojżesz Presburger 
who accomplished his path-breaking work on
    decidability of the theory of addition (which 
today is called Presburger arithmetic) as a student in
    1929. In 2010 the Presburger Award was given 
to MikoÅ‚aj Bojańczyk (Warsaw) for his deep
    contributions to automata theory and to logic 
and algebra in computer science.  Patricia Bouyer-
    Decitre was the recipient of the award in 
2011 for her fundamental contributions to the theory and
    applications of timed automata  as a model of real-time systems.

    Nominations for the Presburger Award can be 
submitted by any member or group of members of
    the theoretical computer science community 
except the nominee and his/her advisors for the
    master thesis and the doctoral dissertation. 
Nominated scientists have to be at most 35 years at
    the time of the deadline of nomination (i.e., 
for the Presburger Award of 2012 the date of birth
    should be in 1976 or later).

    The Presburger Award Committee of 2012 
consists of Monika Henzinger (Vienna), Antonín Kučera
    (Brno) and Stefano Leonardi (Rome, 
chair).   Nominations, consisting of a two page justification and
    (links to) the respective papers, as well as 
additional supporting letters (if any), should be sent to:

    Stefano Leonardi,

    Dipartimento di Ingegneria Informatica,
    Automatica e Gestionale Antonio Ruberti,
    Sapienza University of Rome,
    Via Ariosto 25, 00185 Roma, Italy; or

    leon at dis.uniroma1.it

    by December 31st, 2011.

    The award includes an amount of 1000 Euro and 
an invitation to ICALP2012 for a lecture.
    The Presburger Award is sponsored by BiCi, 
the Bertinoro international Center for informatics.

    For further information: http://www.eatcs.org/index.php/presburger


3) Logical Approaches to Barriers in Complexity II 26 - 30 March 2012
(From A. Beckmann)


                       Newton Institute Workshop
           "Logical Approaches to Barriers in Complexity II"

                          26 - 30 March 2012


    Organisers: Arnold Beckmann (Swansea) and Anuj Dawar (Cambridge)
          in association with the Newton Institute programme
            "Semantics and Syntax: A Legacy of Alan Turing"

      Deadline for application for participation:  26th January 2012


    Computational complexity theory has its 
origin in logic. The fundamental goal of this 
area is to understand the limits of efficient 
computation (that is understanding the class of 
problems which can be solved quickly and with 
restricted resources) and the sources of 
intractability (that is what takes some problems 
inherently beyond the reach of such efficient 
solutions). The most famous open problem in the 
area is the P = NP-problem, listed among the 
seven Clay Millenium Prize problems. Logic 
provides a multifarious toolbox of techniques to 
analyse questions like this, some of which 
promise to provide deep insights in the nature 
and limits of efficient computation.

    In our workshop, we shall focus on logical 
descriptions of complexity, i.e. descriptive 
complexity, propositional proof complexity and 
bounded arithmetic. Despite considerable progress 
by research communities in each of these areas, 
the main open problems remain. In finite model 
theory the major open problem is whether there is 
a logic capturing on all structures the 
complexity class P of polynomial time decidable 
languages. In bounded arithmetic the major open 
problem is to prove strong independence results 
that would separate its levels. In propositional 
proof complexity the major open problem is to 
prove strong lower bounds for expressive propositional proof systems.

    The workshop will bring together leading 
researchers covering all research areas within 
the scope of the workshop. We will especially 
focus on work that draws on methods from the 
different areas which appeal to the whole community.


        Samuel R. Buss (University of California, San Diego)
        Stephan Kreutzer (Technische Universität Berlin)


        Albert Atserias (Universitat Politècnica de Catalunya [UPC])
        Yijia Chen (Shanghai Jiao Tong University)
        Stefan Dantchev (Durham University)
        Arnaud Durand (Université Denis-Diderot Paris 7)
        Bjarki Holm (University of Cambridge)
        Juha Kontinen (University of Helsinki)
        Jan Krajicek (Charles University in Prague)
        Phuong The Nguyen (University of Montreal)
        Rahul Santhanam (University of Edinburgh)
        Nicole Schweikardt (Goethe University)
        Neil Thapen (Academy of Sciences of the Czech Republic)


        The application form for participation in this workshop
        can be found at
        The Deadline for receiving the application is
            26th January 2012


       For further questions concerning this workshop please contact


4) 17th International Conference on 
Implementation and Application of Automata CIAA 2012 cfp

(From R. Reis and N. Moreira)

    CIAA 2012 Call for Papers

    First Call for Papers -- CIAA 2012

    17th International Conference on Implementation and Application of Automata

    Porto, Portugal

    July 17-20, 2012



    CIAA is the premier annual conference for researchers, application
    developers and users of automata-based systems.  The applications of
    the theory of automata, a foundational area of computer science,
    have spread to almost all areas of computer science and many
    other disciplines.

    The CIAA series has published significant papers describing the
    applications of finite automata in parsing and compilers, logic,
    natural language processing, pattern matching, database management,
    and bioinformatics. The conference also accepts papers that advance
    the state of the art in the theoretical study of finite automata,
    regular expressions, grammars and related formal models.

    Another goal of the conference is to provide additions and enhancements to
    existing software systems that manipulate automata, regular expressions,
    grammars, and related structures; examples of 
such systems include AGL, AMoRE,
    ASTL, Automate, FADELA, FAdo, FinITE, FIRE 
Station, FSM, Grail+, INR, Intex,
    JFLAP, MERLin, MONA, TESTAS, Turing's World, 
Vaucanson, WFSC and Whale Calf.


    CIAA invites papers on all aspects of implementation, application, and
    theory of automata and related structures, including but not limited

       Algorithms on automata
       Automata and logic
       Complexity of automata operations
       Computer-aided verification
       Data structure design for automata
       Data and image compression
       Design and architecture of automata software
       Digital libraries
       DNA/molecular/membrane computing
       Document engineering
       Editors, environments
       Experimental studies and practical experience
       Implementation of verification methods and model checking
       Industrial applications
       Natural language and speech processing
       New algorithms for manipulating automata
       Object-oriented modeling
       Pushdown automata and context-free grammars
       Quantum computing
       Structured and semi-structured documents
       Symbolic manipulation environments for automata
       Transducers and multi-tape automata	
       Techniques for graphical display of automata
       Viruses, related phenomena
       World-wide web


    Sixteen previous CIAA conferences took place 
in: Blois (2011), Winnipeg (2010),
    Sydney (2009), San Francisco (2008), Prague 
(2007), Taipei (2006), Nice (2005),
    Kingston (2004), Santa Barbara (2003), Tours 
(2002), Pretoria (2001), London
    Ontario (2000), Potsdam (WIA'99), Rouen (WIA'98), London Ontario (WIA'97),
    London Ontario (WIA'96). See the conference site
    (http://tln.li.univ-tours.fr/ciaa/) for archives on these previous editions


    Submission Deadline: March 11, 2012
    Notification: April 20, 2012
    Final Version: May 7, 2012
    Conference Dates: July 17-20, 2012


    Research papers are sought on all aspects of 
implementation, application, and
    theory of automata and related structures. 
Researchers are invited to submit
    unpublished original research. Simultaneous 
submissions to other venues is not

    Submitted papers must use the LNCS-style LaTeX2e (available at

    Papers must be in English and provide sufficient details to
    allow the program committee to assess their merits. If the authors
    believe that more details are necessary to substantiate the claims of the
    paper, they may include a clearly marked appendix to be read at the
    discretion of the committee.

    Papers will be submitted electronically in 
PDF, using the EasyChair system. Use
    the following link for submission:


    Proceedings will be published by Springer in 
Lecture Notes of Computer Science
    (LNCS) and will be available at the 
conference. Extended versions of selected
    proceedings papers will appear in a special 
issue of International Journal of
    Foundations of Computer Science (IJFCS).


    We encourage the submission of software 
demos. Developers wishing to demonstrate
    their software should submit a two-page 
description to the outlining the design
    of their system and its application area(s). 
The descriptions of accepted demos
    will appear in a booklet available at the 
conference. Soon more information about
    how to submit a demo will be available at the conference website.


    CIAA 2012 will take place in Porto, the 
second largest city in Portugal, located
    by the Douro river and the Atlantic Ocean. 
Porto dates back to the IV century
    and the city center is classified as world 
heritage patrimony by UNESCO. The
    city is also known worldwide for the renowned Port Wine.

    The venue will be the Faculty of Sciences of 
the University of Porto located in
    Campo Alegre area and very close to the conference hotels.


    CIAA 2012 will be held just before DCFS 2012 which will take place in
    Braga, also in Portugal and less then 50 km from Porto, on July
    23--25. More information about this workshop can be found at the web
    page http://www.dcc.fc.up.pt/DCFS12


    Janusz Brzozowski, (U. of Waterloo, Canada)
    José Nuno Oliveira (U. do Minho, Portugal)
    Grzegorz Rozenberg (Leiden, The Netherlands)
    Joseph Sifakis (Grenoble,France)


    Marie-Pierre Beal - France
    Béatrice Bouchou-Markhoff - France
    Patricia Bouyer - France
    Cezar Campeanu - Canada
    Pascal Caron - France
    Jean-Marc Champarnaud - France
    Jan Daciuk - Poland
    Michael Domaratzki - Canada
    Yo-Sub Han - South Korea
    Tero Harju - Finland
    Markus Holzer - Germany
    Oscar Ibarra - USA
    Masami Ito - Japan
    Joost-Pieter Katoen - Germany
    Stavros Konstantinidis - Canada
    Andreas Maletti - Germany
    Sebastian Maneth - Australia
    Denis Maurel - France
    Ian McQuillan - Canada
    Mehryar Mohri - USA
    Nelma Moreira - Portugal (co-chair)
    Alexander Okhotin - Finland
    Giovanni Pighizzini - Italy
    Bala Ravikumar - USA
    Rogério Reis - Portugal (co-chair)
    Kai Salomaa - Canada
    Colin Stirling - United Kingdom
    Bruce Watson - South Africa
    Hsu-Chun Yen - Taiwan
    Mikhail Volkov - Russian Federation
    Sheng Yu - Canada


    Jean-Marc Champarnaud - France
    Oscar Ibarra - USA
    Denis Maurel - France
    Kai T. Salomaa - Canada
    Sheng Yu - Canada (Chair)


    Sabine Broda (U. Porto)
    António Machiavelo (U. Porto)
    Nelma Moreira (U. Porto)
    Rogério Reis (U. Porto)
    Simão Sousa (U. Beira Interior)


    Postal address:

    CIAA 2012
    Rua do Campo Alegre, 1021-1055
    4169-007 Porto,

    Email: ciaa12 at dcc.fc.up.pt


5) BOOK ANNOUNCEMENT: Published 2011 in the 
CiE/Springer book series "Theory and Applications of Computability"


    Published 2011 in the CiE/Springer book series "Theory and Applications of
    Computability" -

    Douglas S. Bridges and Luminita Simona Vita:
    "Apartness and Uniformity: A Constructive Development"

    Largely an exposition of the authors' own research, this is the first book
    dealing with the apartness approach to constructive topology, and is a
    valuable addition to the literature on constructive mathematics and on
    topology in computer science. It is aimed at graduate students and
    advanced researchers in theoretical computer science, mathematics, and
    logic who are interested in constructive/algorithmic aspects of topology.

    Hardcover, ISBN 978-3-642-22414-0

    Please order this book for your personal/university library

    For more information on forthcoming books in the series see:




6) CSR 2012: 1st CfP


    First Call for Papers


    July 3-7, 2012, Nizhni Novgorod, Russia



    CSR 2012 intends to reflect the broad scope of international cooperation in
    computer science. It is the seventh 
conference in a series of regular events
    previously held in St.Petersburg (2006), 
Ekaterinburg (2007), Moscow (2008),
    Novosibirsk (2009), Kazan (2010), and St.Petersburg (2011). The proceedings
    are published in Springer LNCS.


    Deadline for submissions:       December 11, 2011
    Notification of acceptance:     February 17, 2012
    Conference dates:               July 3-7, 2012

    As has become tradition, there will be YANDEX AWARDs
    for the best paper and for the best student paper!


    Nizhni Novgorod was founded by Prince Yuri (George) Vsevolodovich in 1221
    on the confluence of two great Russian rivers, Volga and Oka.
    It is a large city accessible by multiple international airlines
    including regular Lufthansa flights from Frankfurt.

    TOPICS include, but are not limited to:

    * algorithms and data structures
    * automata and formal languages
    * combinatorial optimization
    * constraint solving
    * computational complexity
    * cryptography
    * combinatorics in computer science
    * computational models and concepts
    * algorithms for concurrent and distributed systems, networks
    * proof theory and applications of logic to computer science
    * model checking
    * automated reasoning
    * deductive methods


    * Lev Beklemishev (MI RAS)
    * Mikolaj Bojanzcyk (Warsaw)
    * Julien Cassaigne (Marseille)
    * Jaroslav Nesetril (Prague)
    * Pavel Pevzner (UCSD and SPbAU RAS)

    TURING LECTURE connected to the THE ALAN TURING YEAR 2012 will be given by

    * Yuri Matiyasevich (PDMI RAS)


    * Susanne Albers (Berlin)
    * Andris Ambainis (Riga)
    * Alberto Bertoni (Milan)
    * Bruno Durand (Marseille)
    * Edward A. Hirsch (PDMI RAS)
    * Juraj Hromkovic (ETH Zurich)
    * Kazuo Iwama (Kyoto)
    * Juhani Karhumaki (Turku, chair)
    * Markus Lohrey (Leipzig)
    * Ernst Mayr (Munich)
    * Ilya Mironov (Microsoft Research)
    * Anca Muscholl  (Bordeaux)
    * Alexander Okhotin (Turku)
    * Alexander Razborov (Chicago)
    * Wojcieh Rytter (Warsaw)
    * Jiri Sgall (Prague)
    * Alexander Shen (Moscow)
    * Arseny Shur (Ekaterinburg)
    * Wofgang Thomas (Aachen)
    * Nikolai Vereshchagin (Moscow)
    * Mikhail Vyalyi (CC RAS)
    * Gerhard Woeginger (Eindhoven)


    N.I.Lobachevsky State University of Nizhni Novgorod


    Michail Prilutskii (UNN)


    Authors are invited to submit an extended 
abstract or a full paper of at most
    12 pages in the LNCS format (LaTeX, as pdf; final version with source),
    in English; instructions can be found at
    Proofs and other material omitted due to 
space constraints are to be put into
    a clearly marked appendix to be read at discretion of the referees. Papers
    must present original (and not previously published) research. Simultaneous
    submission to journals or to other 
conferences with published proceedings is
    not allowed.  The proceedings of the 
symposium will be published in Springer's
    LNCS series.

    Submissions should be uploaded to the EasyChair Conference system:


    Web:    http://agora.guru.ru/display.php?conf=csr2012
    Email:  csr2012.conf at gmail.com


7) LPAR-18 Call for Papers and Workshops

                            2nd CALL FOR PAPERS
                         CALL FOR WORKSHOP PROPOSALS

                     The 18th International Conference on
           Logic for Programming, Artificial Intelligence and Reasoning

                      Merida, Venezuela - March 11-15, 2012

    This is the second call for papers for 
LPAR-18 and the first call for workshop
    proposals. Information about workshop 
proposals is included at the end of this

    The series of International Conferences on 
Logic for Programming, Artificial
    Intelligence and Reasoning (LPAR) is a forum 
where, year after year, some of
    the most renowned researchers in the areas of logic, automated reasoning,
    computational logic, programming languages and their applications come to
    present cutting-edge results, to discuss advances in these fields, and to
    exchange ideas in a scientifically emerging 
part of the world. The 18th LPAR
    will be held in Merida, Venezuela.

    Logic is a fundamental organizing principle 
in nearly all areas in Computer
    Science. It runs a multifaceted gamut from the foundational to the applied.
    At one extreme, it underlies computability 
and complexity theory and the formal
    semantics of programming languages. At the 
other extreme, it drives billions
    of gates every day in the digital circuits of 
processors of all kinds. Logic
    is in itself a powerful programming paradigm, 
but it is also the quintessential
    specification language for anything ranging 
from real-time critical systems to
    networked infrastructures. Logical techniques link implementation and
    specification through formal methods such as automated theorem proving and
    model checking. Logic is also the stuff of knowledge representation and
    artificial intelligence. Because of its 
ubiquity, logic has acquired a central
    role in Computer Science education.

    New results in the fields of computational 
logic and applications are welcome.
    Also welcome are more exploratory presentations, which may examine open
    questions and raise fundamental concerns 
about existing theories and practices.

    Topics of interest include, but are not limited to:
     * Automated reasoning
     * Verification
     * Interactive theorem proving and proof assistants
     * Model checking
     * Implementations of logic
     * Satisfiability modulo theories
     * Rewriting and unification
     * Logic programming
     * Satisfiability checking
     * Constraint programming
     * Decision procedures
     * Logic and games
     * Logic and the Web
     * Ontologies and large knowledge bases
     * Logic and databases
     * Modal and temporal logics
     * Program analysis
     * Foundations of security
     * Description logics
     * Non-monotonic reasoning
     * Uncertainty reasoning
     * Logics for vague and inconsistent data
     * Specification using logic
     * Logic in artificial intelligence
     * Logic and types
     * Logical foundations of programming
     * Logical aspects of concurrency
     * Logic and computational complexity
     * Knowledge representation and reasoning
     * Logic of distributed systems

    Programme Chairs
     * Nikolaj Bjorner
     * Andrei Voronkov

    Conference Chair
     * Geoff Sutcliffe

    Workshop Chair
     * Laura Kovacs

    Local Arrangements Chair
     * Blanca Abraham

    PC - preliminary
     * Jose Aguilar
     * Elvira Albert
     * Franz Baader
     * Gilles Barthe
     * Peter Baumgartner
     * Armin Biere
     * Nikolaj Bjorner
     * Thierry Coquand
     * Veronike Cortier
     * Luca De Alfaro
     * Christian Fermueller
     * John Harrison
     * Pascal Van Hentenryck
     * Manuel Hermengildo
     * Barbara Jobstmann
     * Deepak Kapur
     * Konstantin Korovin
     * Laura Kovacs
     * Carsten Lutz
     * Parthasarathy Madhusudan
     * Aart Middeldorp
     * Dale Miller
     * Cesar Munoz
     * Albert Oliveras
     * Lawrence Paulson
     * Ruzica Piskac
     * Francesca Rossi
     * Grigore Rosu
     * Torsten Schaub
     * Natarajan Shankar
     * Wolfgang Thomas
     * Cesare Tinelli
     * Andrei Voronkov
     * Toby Walsh
     * Christoph Weidenbach
     * Frank Wolter

    Submission Details
    Submissions of two kinds are welcome:

     * Regular papers that describe solid new research results. They can be
       up to 15 pages long in LNCS style, including figures and references,
       but excluding appendices (that reviewers are not required to read).
     * Experimental and tool papers that describe implementations of systems,
       report experiments with implemented systems, or compare implemented
       systems. They can be up to 8 pages long in the LNCS style.

    Both types of papers can be electronically submitted in PDF via EasyChar:
    Prospective authors are required to register 
a title and an abstract a week
    before the paper submission deadline (see below).

    Authors of accepted papers are required to 
ensure that at least one of them
    will be present at the conference.

    Important Dates
     * Abstract submission: 23 October 2011
     * Paper submission: 1 November 2011
     * Notification of acceptance: 20 December 2011
     * Camera-ready papers: 10 January 2012
     * Conference: 11-15 March 2012

    Workshop Proposals
    LPAR-18 workshops will be held on March 10, either as one-day or half-day
    events. If you would like to propose a 
workshop for LPAR-18, please contact
    the workshop chair via email 
(lkovacs at complang.tuwien.ac.at), by the proposal
    deadline, November 15th.

    To help planning, workshop proposals should contain the following data:
     * Name of the workshop.
     * Brief description of the workshop, including workshop topics.
     * Contact information of the workshop organizers.
     * An estimate of the audience size.
     * Proposed format of the workshop (for example, regular talks,
       tool demos, poster presentations, etc.).
     * Duration of the workshop (one-day or half-day).
     * Potential invited speakers (if any).
     * Procedures for selecting papers and participants.
     * Special technical or AV needs.

    Important workshop dates
     * Workshop proposals: 15 November 2011
     * Notification of workshops proposals: 1 December 2011


8) DCM 2012: Developments in Computational 
Models, Cambridge (U.K.), 17 June 2012


    DCM 2012
    8th International Workshop on Developments in Computational Models
    A satellite workshop of CiE 2012
    Sunday, 17 June 2012; Corpus Christi College; Cambridge, England

    Several new models of computation have 
emerged in the last few years, and many 
developments of traditional computational models 
have been proposed with the aim of taking into 
account the new demands of computer systems users 
and the new capabilities of computation engines. 
The aim of the workshop series Developments in 
Computational Models is to bring together 
researchers who are currently developing new 
computational models or new features for 
traditional computational models, in order to 
foster their interaction, to provide a forum for 
presenting new ideas and work in progress, and to 
enable newcomers to learn about current activities in this area.

    DCM 2012 is part of the celebrations of the 
Turing Centenary and is a satellite event of the 
conference Computability in Europe. It will take 
place on 17 June, the day before the Bletchley 
Park excursion of CiE 2012. All participants of 
CiE 2012 and researchers interested in new models 
of computation in general are cordially invited 
to submit a paper to DCM 2012. A Call for Papers 
will be issued within the next few months.


    Luca Cardelli
    Microsoft Research Cambridge, United Kingdom

    Martin Escardo
    University of Birmingham, United Kingdom

    Elvira Mayordomo
    Universidad de Zaragoza, Spain


    Arnold Beckmann, Swansea University, Wales
    Vincent Danos, Universite Paris-Diderot, France
    Mariangiola Dezani, Universita  di Torino, Italy
    Viv Kendon, Leeds University, England
    Benedikt Loewe, Universiteit van Amsterdam, The Netherlands (co-chair)
    Ian Mackie, Ecole Polytechnique, France
    Florin Manea, Universitatea din Bucuresti, Romania
    Dag Normann, Universitetet i Oslo, Norway
    Prakash Panangaden, McGill University, Canada
    Femke van Raamsdonck, Vrije Universiteit Amsterdam, The Netherlands
    Glynn Winskel, Cambridge University, England (co-chair)


    The workshop will be held at The College of 
Corpus Christi and the Blessed Virgin Mary at the 
University of Cambridge, in the Harley-Mason Room.

    Contact: bloewe (at) science.uva.nl


9) COMPUTING 2011 - Symposium on 75 Years of Turing Machine and Lambda-Calculus


                         Call for Participation

                             COMPUTING 2011

         Symposium on 75 Years of Turing Machine and Lambda-Calculus

                KIT, Karlsruhe, Germany, October 20-21, 2011



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

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

      * Different Models of Computing (including, e.g., Parallel, Quantum,
        and Molecular/DNA Computing),
      * Complexity (including Computational and Parameterized Complexity),
      * Decidability of various Logical and Computational Systems,
      * Termination Analysis,
      * Computational Geometry.

    The symposium will consist of invited talks 
given by both established and junior scientists.

    Keynote Speakers

      * Henk Barendregt, Radboud University Nijmegen, The Netherlands
      * Christof Teuscher, Portland State University, USA
      * Wolfgang Thomas, RWTH Aachen University, Germany


    We invite you to attend COMPUTING 2011. Registration is open at



    COMPUTING 2011 is organized by the Institute of Cryptography and
    Security (IKS) and the Institute of Theoretical Informatics (ITI) of
    Karlsruhe Institute of Technology.

    Symposium Chair / Contact

    Olga Tveretina, olga at ira.uka.de

    Program / Organizing Committee

    Bernhard Beckert, ITI
    Jacques Calmet, IKS
    Stephan Falke, ITI
    Christoph Gladisch, ITI
    Dennis Hofheinz, IKS
    Jörn Müller-Quade, IKS
    Peter H. Schmitt, ITI
    Carsten Sinz, ITI
    Mana Taghdiri, ITI
    Olga Tveretina, ITI
    Roland Vollmar, IKS
    Thomas Worsch, IKS

    COMPUTING 2011 will be co-located with Deduktionstreffen 2011

    The symposium is sponsored by KIT's Karlsruhe 
House of Young Scientists (KHYS).


10) TAMC 2012, MAY 16-21: CALL FOR PAPERS


    9th Annual Conference on Theory and Applications of Models of Computation

     Turing Centenary Meeting, Chinese Academy of Sciences, Beijing, China

    			May 16-21, 2012




    Institute of Software, Chinese Academy of Sciences. All
    lectures and talks will be arranged in Building No. 5, Software Park,
    Chinese Academy of Sciences.

    CONTACT: Prof. Angsheng Li at angsheng at ios.ac.cn


    * S. Barry Cooper ( Leeds )
    * John Hopcroft( Cornell)
    * Richard Karp (Berkeley)
    * Jon Kleinberg (Cornell)
    * Butler Lampson (Microsoft)
    * Wei Li (BUAA)
    * Andrew Chi-Chih Yao (Tsinghua, Beijing)


    1. Algorithms and Information in Networks (Organising Chairs: Zhiyong Liu )
    2. Complexity and Cryptography (Organising Chair: Xiaotie Deng)
    3. Models of Computing and Networking (Organising Chairs: Anthony Bonato )
    4. Programming and Verification (Organising Chair: Wenhui Zhang)


    * Submission deadline: 11:59pm EST Jan. 10, 2012.
    * Notification of authors: Feb. 20, 2012.
    * Final versions deadline: Due on March 10, 2012.


    Accepted papers will be published in the conference proceedings, in
    the LNCS Series by Springer.
    Authors of accepted papers are expected to present their work at the


    Special issues of the journals Theoretical Computer Science and
    Mathematical Structures in Computer Science devoted to a
    selected set of accepted papers of the conference are planned.


    * Authors should submit an extended abstract (not a full paper).

    * The submission should contain a scholarly exposition of ideas,
    techniques, and results, including motivation and a clear comparison
    with related work.

    * The length of the extended abstract should not exceed ten (10)
    letter-sized pages (not including bibliography and appendices.)

    * Submitted papers must describe work not previously published. They
    must not be submitted simultaneously to another conference with refereed
    proceedings. Research that is already submitted to a journal may be
    submitted to TAMC12, provided that (a) the PC chair is notified in advance
    that this is the case, and (b) it is not scheduled for journal
    publication before the conference.


    * Manindra Agrawal (Co-chair, Indian Institute of Technology Kanpur)
    * Marat Arslanov (Kazan)
    * Giorgio Ausiello (Rome, Italy)
    * George Barmpalias (ISCAS)
    * Anthony Bonato (Ryerson University, Can.)
    * Cristian S. Calude (University of Auckland )
    * Alessandra Carbone (Paris)
    * Jianer Chen (Texas A&M University)
    * Wei Chen (Microsoft Research Asia)
    * Francis Chin (University of Hong Kong)
    * S. Barry Cooper (Co-chair, University of Leeds, UK)
    * Gilles Dowek (Paris)
    * Zhenhua Duan (Xidian University)
    * Mike Fellows (Charles Darwin University, Australia)
    * Kazuo Iwama (Kyoto University)
    * Andrew Lewis (University of Leeds)
    * Angsheng Li (Co-chair, Chinese Academy of Sciences)
    * Zhiyong Liu (Chinese Academy of Sciences)
    * Weiyi Liu (Yunnan University)
    * Giuseppe Longo (Paris, France)
    * Mitsunori Ogihara (Miami)
    * Luke Ong (Oxford)
    * Xiaoming Sun (Tsinghua University)
    * Mingji Xia (ISCAS)
    * Peng Zhang (Shandong University)
    * Naijun Zhan (ISCAS)
    * Yongji Wang (ISCAS)
    * Hanpin Wang (Beijing University)
    * Osamu Watanabe (Tokyo Institute of Technology)
    * Ting Zhang (Iowa State University)


    * George Barmpalias (ISCAS)
    * Yunfu Cao (ISCAS)
    * Haiming Chen (ISCAS)
    * Zhiming Ding (ISCAS)
    * Angsheng Li (ISCAS, co-chair)
    * Yucheng Li (ISCAS, co-chair)
    * Dongdai Lin (ISCAS)
    * Kelong Liu (ISCAS)
    * Hongan Wang (ISCAS)
    * Mingji Xia (ISCAS)
    * Ye Yang (ISCAS)
    * Yongji Wang (ISCAS)
    * Naijun Zhan (ISCAS)


    TAMC aims at bringing together a wide range of researchers with
    interests in computational theory and applications.
    The main themes of the conference TAMC 2012 will be Computability,
    Complexity, and Algorithms with extensions to information and networks.

    Typical but not exclusive topics of interest include:

    * Algorithmic algebra,
    * Algorithmic graph theory and combinatorics
    * Algorithms and data structures
    * Approximation algorithms
    * Automata and neural networks
    * Computational biology, and bio-informatics
    * Computational complexity
    * Computational game theory, network game theory
    * Computational geometry
    * Computable mathematics
    * Continuous and real computation
    * Cryptography and complexity
    * Decidability and undecidability
    * Derandomization
    * Error correcting code and locally testable codes
    * Generalized and higher type computation
    * Internet mathematics
    * Learning theory, and intelligent computing
    * Local test of mathematical properties
    * Models of computing and networking
    * Natural computation
    * Network algorithms
    * Networking
    * Networks in nature and society - new laws and principles
    * Number theory and coding theory
    * On-line algorithms and parallel algorithms
    * Physical computability
    * Programm checking
    * Programming and verication
    * Proofs and computation
    * Quantum computing
    * Randomized algorithms
    * Randomness in complexity classes and in nature
    * Relative computability and degree structures
    * Robustness and security of networks
    * Theory of networks and emergence
    * Turing definability


11) Call for Workshop Proposals: LICS 2012, 
Dubrovnik (Croatia), 25-28 June 2012

                                           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


12) International Conference on the History and 
Philosophy of Computing, Gent (Belgium), 7-10 Nov 2011

Début du message réexpédié :
De : "[LOGIC] Mailing List" <logic at math.uni-bonn.de
Objet : [LOGIC] CfPart: HAPOC-11, Gent (Belgium), 7-10 Nov 2011
Date : 23 septembre 2011 15:27:57 HAEC
À : undisclosed-recipients: ;

International Conference on the History and Philosophy of Computing
7-10 November 2011
Ghent University, Ghent, Belgium

Celebrating the 75th anniversary of the famous 1936
Papers by A. Church, E.L. Post and A.M. Turing.

 From 7-10 November 2011 the Centre for Logic and 
Philosophy of Science, Ghent University organizes 
an International Conference on the History and Philosophy of Computing.

Bill Aspray (University of Texas)
Martin Davis (New York University, UC Berkeley)
Fairouz Kamareddine (Heriot-Watt University Edinburgh)
Sybille Krämer (Freie Universität Berlin)
Giovanni Sambin (Universita' di Padova)
Raymond Turner (University of Essex)
Stephen Wolfram (Wolfram Research)


Liesbeth De Mol and Giuseppe Primiero?

G. Alberts (Amsterdam); S. Artemov (New York); M. Campbell-Kelly (Warwick); L.
Corry (Tel Aviv) M. Denecker (Leuven); A. Eden (Essex); L. Floridi (Oxford &
Hertfordshire); R. Kahle (Lisbon); B. Loewe (Amsterdam); J. Meheus (Ghent); E.
Myin (Antwerp); S. Negri (Helsinki) V. de Paiva (Palo Alto); S. Smets
(Groningen); G. Sundholm (Leiden); C. Toffalori (Camerino); J.-.P. van Bendegem
(Brussels); M. van Dyck (Ghent); B. van Kerkhove (Brussels & Hasselt); E. Weber


A selection of papers will be published as a special issue of the journal
Philosophy & Technology (Springer)?

We also intend to publish a selection of papers in a special issue of History
and Philosophy of Logic  (Taylor & Francis)

More details will follow later.

For further information please contact us at:?

computing.conference at ugent.be

or have a look at our website:

More information about the FOM mailing list