cie-logo   Association CiE

  • As a member of CIE association you have a free access to Journal Computability: please follow this personal link

  • CIE Newsletter - No. 75

    CiE Newsletter No. 75, December 15th, 2013

    Please send any items you would like included in next letter to Olivier Bournez (
    DEADLINE: January 10th, 2014.


    1 ) PhD studentships in Mathematical Foundations of Computation, Bath (U.K.)
    *** Three-year PhD Studentships from October 2014 at the University of Bath ***
    Research team:
      Mathematical Foundations of Computation
      (Proofs, Categories, Semantics, Geometry and Computer Algebra)
      University of Bath
    Potential supervisors:
      Russell Bradford
      Paola Bruscoli
      James Davenport
      Alessio Guglielmi
      Willem Heijltjes
      Jim Laird
      Guy McCusker
      John Power
      Nicolai Vorobjov
    To apply, including information on prerequisites:
    50th Anniversary Excellence Studentship for an Overseas Research Student:
      12 December 2013 is the application deadline
    We offer PhD positions to brilliant graduates with an interest in mathematics and theoretical computer science.
    Proofs and algorithms are everyday objects in our discipline, but they are still very mysterious. Suffice to say that we are currently unable to decide whether two given proofs or two given algorithms are the same; this is an old problem that dates back to Hilbert. Also, proofs and algorithms are intimately connected in the most famous open problem in mathematics: P vs NP.
    We make progress by trying to unveil the fundamental structure behind proofs and algorithms, what we call their semantics. In other words, we are interested in the following questions:
      What is a proof?
      What is an algorithm?
      How can we define them so that they have efficient and natural semantics?
    The questions above are interesting in their own right, but we note that answering them will enable technological advances of great impact on the society and the economy. For example, it will be possible to build a worldwide, universal tool for developing, validating, communicating and teaching mathematics. Also, quickly producing provably bug-free and secure software will become possible, so solving one of the most complex and important open engineering problems.
    In order to understand proofs and algorithms we create new mathematics starting from proof theory and semantics and utilising, among other tools, category theory and algebraic geometry. These theories are closely related, they benefit from mutual interaction and they are well represented in our team. The methods we use are mostly discrete, algebraic and combinatorial, but there is a growing geometrical component. The recent advances which our methods are mostly based on are linear logic, game semantics and deep inference on the logic side, and regular chains, cylindrical algebraic decomposition and monotone sets on the algebra/geometry side.
    Last year three new PhD students joined us, each fully covered by a scholarship, from the University of Cambridge, ETH Zurich and Université Paris VII. Our group is very well financed via several grants. Thanks to our international relations, working with us means having a truly multicultural experience together with all the researchers at the forefront of this worldwide research effort. As a result, all our graduates work and publish at the highest level. The facilities at the University of Bath are outstanding and the city is so beautiful that UNESCO recognises it as a World Heritage Site.
    The best applicants who are nationals from outside the European Union will be considered for some of ten "50th Anniversary Excellence Studentships for Overseas Research Students". The scholarships cover the full overseas fee, a stipend and a training support grant for three years. In other words, if you manage to win one of these scholarships you will be able to obtain an excellent PhD and maintain yourself without the need for any extra money. To be considered you need to apply before the deadline indicated above.
    There will be other scholarships, for which the deadline above does not apply, that will cover all or part of the tuition fees. The details of these scholarships will be known later in the year, but you can apply and indicate if you need financial support right now.
    To obtain more information and to apply, please follow the link above and choose the PhD programme in Computer Science. Feel free to contact Alessio Guglielmi (A.Guglielmi AT Bath.Ac.UK) for any questions about a PhD in Proofs, Categories and Semantics, or contact James Davenport (J.H.Davenport AT Bath.Ac.UK) for a PhD in Geometry and Computer Algebra.

    2 ) Horizon 2020 launched 11 December 2013

    Dear Association CiE member

    The EU's research funding programme for 2014-2020, Horizon 2020, is being
    launched on 11 December 2013. In preparation for this the majority of the
    draft Work Programmes, are now available to download at:

    The Work Programmes are being made public prior to the adoption process of
    the Work Programmes by the Commission and their contents may therefore
    still change. It is however expected that any changes will be minor at
    this stage.

    Particularly relevant to CiE members will be Pillar 1 - Excellent Science,
    which is allocated a total budget of 30% of that for Horizon 2020. Under
    this heading come:

    * European Research Council
    * Marie Sklodowska-Curie Actions
    * Research Infrastructures
    * Future and Emerging Technologies

    ERC Calls in 2014 unclude:

    * Starting Grants (2-7 years postdoc) Up to 2m euros for 5 years
    Call opens Dec. 11 2013, closes 25 March 2014 (budget 485M)

    * Consolidator Grants (7-12 years postdoc) Up to 2.75m euros for 5 years
    Opens Dec. 11 2013, closes 20 May 2014 (budget 713M)

    * Advanced Grants (Leading researchers) Up to 3.5m euros for 5 years
    Opens 17 June 2014, closes 21 Oct. 2014 (budget 450M)

    * Synergy Grants (2-4 PIs) Up to 15m euros for 6 years
    No call in 2014

    * Proof of Concept (ERC grant holders) 350k for up to 18 months
    Opens Dec. 11, closes 1 April 2014, 1 Oct. 2014 (budget 15M)

    MSCA Schemes:

    * ITN (Innovative Training Networks) - Replaces FP7 ITNs, now only ESRs
    ITN 2014 - Call 11 Dec. 2013 to 6 Apr. 2014 (405M)
    ITN 2015 - 2 Sep. 2014 to 13 Jan. 2015 (370M)

    * IF (Individual Fellowships for ERs) - Replaces IEF, IOF, IIF, CIG
    Last 12-24 months, split into European Fellowships, Global Fellowships
    IF 2014 - Call 12 Mar. 2014 to 11 Sep. 2014 (240M)
    IF 2015 - 12 Mar. 2015 to 10 Sep. 2015 (213M)

    * RISE (Research & Innovation Staff Exchange) - Replaces IAPP, IRSES
    Funds Networking, Workshops, Conferences, Career development, New skills
    RISE 2014 - Call 11 Dec. 2013 to 24 Apr. 2014 (70M)
    RISE 2015 - Call 6 Jan. 2015 to 28 Apr. 2015 (80M)

    * COFUND (Cofunding or regional, national & International Programmes)
    Supports ESRs under Doctoral programmes, ERs under Fellowship progs.
    COFUND 2014 - Call 10 Apr. 2014 to 2 Oct. 2014 (80M)
    COFUND 2015 - 14 Apr. 2015 to 1 Oct. 2015 (80M)

    FET Activities:

    * FET Open (Exploring new ideas) - Individual research projects, 40% of
    FET budget - early 'off the wall' ideas - single stage application
    Call opens 11 Dec. 2013, closing 30 Sep. 2014 (77M), 31 Mar. 2015 (37M),
    29 Sep. 2015 (40M)

    * FET Proactive (Emerging themes and communities) - 3 Topics
    Opens 11 Dec. 2013, closing 1 April 2014 - single stage (10+20M)

    * FET Flagships (Grand interdisciplinary challenges) - Flagships already
    decided (eg, Human Brain) - see webpages for details

    * FET HPC (High Performance Computing) - split HPC 1(94M), 2(4M), 3(2M)
    Calls 11 Dec. 2013 to 25 Nov. 2014

    See webpage:
    for Research Infrastructures (Calls open 11 Dec. 2013)

    There is much else under other Pillars of Horizon 2020, involving
    Industrial and Societal themes, etc. See:

    Best wishes

    Barry Cooper
    for Association CiE

    3 ) CfP special issue of MSCS on "Continuity, Computability, Constructivity", Deadline: 31 Jan 2014

    Continuity, Computability, Constructivity:
    From Logic to Algorithms 2013

    Call for Submissions

    After a year of successful work in the EU-IRSES project COMPUTAL and an excellent workshop in Gregynog (Wales) in June this year, we are planning to publish a special issue of


    dedicated to the meeting and the project.

    The special issue should reflect progress made in Computable Analysis and related areas,not only our work in the project.

    Submissions are welcome from all scientists working in fields like

    Computable analysis
    Complexity of real number computations
    Computing with continuous data
    Domain theory and analysis
    Randomness and computable measure theory
    Models of computation with real numbers
    Realizability theory and analysis
    Reverse analysis
    Exact real number computation
    Program extraction in analysis.


    Hajime Ishihara (JAIST, Japan)
    Margarita Korovina (Novosibirsk, Russia)
    Arno Pauly (Cambridge, UK)
    Monika Seisenberger (Swansea, UK)
    Dieter Spreen (Siegen, Germany, and Pretoria, South Africa)


    31 January 2014


    28 February 2014


    We want to split the submission process into two parts: Please, first submit an abstract of your paper and then later the full paper.

    Please prepare your manuscript using the MSCS style file which can be downloaded from

    and submit both the abstract as well as the full manuscript to

    Best regards,

    Hajime Ishihara
    Margarita Korovina
    Arno Pauly
    Monika Seisenberger
    Dieter Spreen

    4 ) FAW 2014: Call for Participation
    The 8th International Frontiers of Algorithmics Workshop (FAW 2014 and the 10th International Symposium
    on Bioinformatics Research and Applications (ISBRA 2014 will be jointly held on June 28-30,
    2014 at Zhangjiajie, China.
    The 8th International Frontiers of Algorithmics Workshop (FAW 2014) will
    provide a focused forum on current trends of research on algorithms,
    discrete structures, operation research, combinatorial optimization, and
    their applications, and will bring together international experts at the
    research frontiers in these areas to exchange ideas and to present
    significant new results. Typical, but not exclusive, topics of interest
    Algorithms and data structures;
    Algorithmic game theory and incentive analysis;
    Approximation algorithms and online algorithms;
    Automata, languages, logic, and computability;
    Bioinformatics, computational biology and medicine, and biomedical
    Biomedical imaging algorithms;
    Combinatorial optimization;
    Combinatorics and discrete structures related to algorithms and
    Communication networks and optimization;
    Complexity theory;
    Computational algebra, geometry, number theory, and statistics;
    Computational learning theory, knowledge discovery, and data mining;
    Cryptography, reliability, and security;
    Database theory, large databases, and natural language processing;
    Experimental algorithmic methodologies;
    Geometric information processing and communication;
    Graph algorithms and theory;
    Graph drawing and information visualization;
    Internet algorithms and protocols;
    Large graph algorithms and social network analysis;
    Optimization algorithms in economic and operations research;
    Parallel and distributed computing and multicore algorithms;
    Parameterized algorithms, heuristics, and analysis;
    Pattern recognition algorithms;
    Trustworthy algorithms and trustworthy software.
    The proceedings of the Conference will be published by Springer-Verlag in
    the Lecture Notes in Computer Science (LNCS) series, and will be
    available for distribution at the conference. Selected high quality
    papers will be invited to a special issue in the journal of Theoretical
    Computer Science and in the Journal of Combinatorial Optimization,
    respectively. The invited papers will go through the normal reviewing
    Important Dates
    Submission deadline:                 February 1, 2014
    Notification of acceptance:        March 15, 2014
    Final version due:                      April 15, 2014
    Program Chairs
    Jianer Chen                             (Texas A&M University, USA;
    Central South University, China)
    John Hopcroft                         (Cornell University, USA)
    Jianxin Wang                           (Central South University, China)
    Program Committee
    Marat Arslanov
    (Kazan State University, Russia)
    Hans Bodlaender
    (Utrecht University, Netherlands)
    Yixin Cao
    (Hungarian Academy of Sciences, Hungary)
    Xi Chen
    (Columbia University, USA)
    Marek Chrobak
    (University of California, Riverside, USA)
    Barry Cooper
    (University of Leeds, United Kingdom)
    Qilong Feng
    (Central South University, China)
    Henning Fernau
    (University of Trier, Germany)
    Mordecai Golin
    (Hong Kong University of Science & Technology, China)
    Gregory Gutin
    (University of London, United Kingdom)
    Tomio Hirata
    (Nagoya University, Japan)
    Hiro Ito
    (University of Electro-Communications, Japan)
    Klaus Jansen
    (University of Kiel, Germany)
    Lyad Kanj
    (DePaul University, USA)
    Ming-Yang Kao
    (Northwestern University, USA)
    Naoki Katoh
    (Kyoto University, Japan)
    Michael Langston
    (University of Tennessee, USA)
    Guohui Lin
    (University of Alberta, Canada)
    Tian Liu
    (Peking University, China)
    Daniel Lokshtanov
    (University of California San Diego, USA)
    Dániel Marx
    (Hungarian Academy of Sciences, Hungary)
    Venkatesh Raman
    (Institute of Mathematical Sciences, India)
    Peter Rossmanith
    (RWTH Aachen University, Germany)
    Ulrike Stege
    (University of Victoria, Canada)
    Xiaoming Sun
    (Institute of Computing Technology, CAS, China)
    Gerhard Woeginger
    (Eindhoven University of Technology, Netherlands)
    Ge Xia
    (Lafayette College, USA)
    Ke Xu
    (Beihang University, China)
    Boting Yang
    (University of Regina, Canada)
    Binhai Zhu
    (Montana State University, USA)
    We cordially invite your participation in FAW 2014, and look forward to
    meeting you in Zhangjiajie, a rising tourist city famous for its unique
    natural scenery and abundant tourism resources.

    5 ) "Is computation observer-relative?", London (U.K.), 1-4 Apr 2014

    ***full paper submission deadline: 3 January 2014***

    The 7th AISB Symposium on Computing and Philosophy:
    Is computation observer-relative?

    AISB-50, Goldsmiths, London, 1-4 April 2014

    As part of the AISB-50 Annual Convention 2014 to be held at Goldsmiths,
    University of London

    The convention is organised by the Society for the Study of Artificial
    Intelligence and Simulation of Behaviour (AISB)


    One of the claims integral to John Searle?s critique of computational
    cognitive science and ?Strong AI? was that computation is
    ?observer-relative? or ?observer-dependent? (Searle, The Rediscovery of
    the Mind, 1992). This claim has already proven to be very controversial in
    cognitive science and AI (Endicott 1996; Coulter & Sharrock, Rey, and
    Haugeland in Preston & Bishop (eds.), Views into the Chinese Room, 2002).

    Those who come to the subject of computation via physics, for example,
    often argue that computational properties are physical properties, that
    is, that computation is ?intrinsic to physics?. On such views, computation
    is comparable to the flow of information, where information is conceived
    of in statistical terms, and thus computation is both observer-independent
    and (perhaps) ubiquitous. Connected with this are related issues about
    causality and identity (including continuity of), as well as the question
    of alternative formulations of information.

    This symposium seeks to evaluate arguments, such as (but not limited to)
    Searle?s, which bear directly on the question of what kind of processes
    and properties computational processes and properties are. It thus seeks
    to address the general question ?What is computation?? in a somewhat
    indirect way. Questions that might be tackled include: Are computational
    properties syntactic properties? Are syntactic properties discovered, or
    assigned? If they must be assigned, as Searle argues, does this mean they
    are or can be assigned arbitrarily? Might computational properties be
    universally realized? Would such universal realizability be objectionable,
    or trivialise computationalism? Is syntax observer-relative? What kinds of
    properties (if any) are observer-relative or observer-dependent? Is
    observer-relativity a matter of degree? Might the question of whether
    computation is observer-relative have different answers depending on what
    is carrying out the computation in question? Might the answer to this
    question be affected by the advent of new computing technologies, such as
    biologically- and physically-inspired models of computation? Is it time to
    start distinguishing between different meanings of ?computation?, or is
    there still mileage in the idea that some single notion of computation is
    both thin enough to cover all the kinds of activities we call
    computational, and yet still informative (non-trivial)? Does Searle?s idea
    that syntax is observer-relative serve to support, or instead to
    undermine, his famous ?Chinese Room argument??



    Questions of ontology and epistemology


    Is computation an observer relative phenomenon? What implications do
    answers to this question have for the doctrine of computationalism?


    Does computation (the unfolding process of a computational system)
    define a natural kind? If so, how do we differentiate the
    computational from the non-computational?


    ?? To what extent and in what ways can we say that computation is
    taking place in natural systems?
    Are the laws of natural processes computational? Does a rock
    implement every input-less FSA
    (Putnam, Chalmers)? Is the evolution of the universe computable as
    the output of an algorithm?
    I.e. is the temporal evolution of a state of the universe a digital
    informational process akin to what goes on in the circuitry of a
    Digital ontology'(Zuse), "the nature of the physical universe is
    ultimately discrete"; cf. Kant's distinction - from the antinomies of
    pure reason - of "simple parts" and no simple parts; the discrete
    and the analogue.


    Computation in machines and computation in nature; Turing versus
    non-Turing computation


    Investigating the difference between formal models of physical and
    biological systems and physical/biological reality-in-itself and the
    implication(s) for theory of mind / cognition.

    (a) The study of 'computation' using natural processes / entities
    (i.e. machines not exclusively based on [man-made] silicon-based

    (b) What is the underlying nature of such natural [physical/biological]
    computational processes? I.e. are the laws of natural processes
    computational at their very core OR merely contingently
    computational because the mathematical language we use to express
    them is biased towards being computational?


    Submissions must be full papers and should be sent via EasyChair:

    Text editor templates from a previous convention can be found at:

    We request that submitted papers are limited to eight pages. Each paper
    will receive at least two reviews. Selected papers will be published in
    the general proceedings of the AISB Convention, with the proviso that at
    least ONE author attends the symposium in order to present the paper and
    participate in general symposium activities.


    i. Full paper submission deadline: 3 January 2014
    ii. Notification of acceptance/rejection decisions: 3 February 2014
    iii. Final versions of accepted papers (Camera ready copy):
    24 February 2014
    iv. Convention: 1st - 4th April 2014, Goldsmiths, University of
    London, UK [symposium date to be confirmed]


    There will be separate proceedings for each symposium, produced before the
    Congress, and available to conference delegates. In previous years there
    have been awards for the best student paper, and limited student
    bursaries. These details will be circulated as and when they become
    available. Authors of a selection of the best papers will be invited to
    submit an extended version of the work to a journal special issue.


    Symposium Chair: Dr. John Preston, Department of Philosophy,
    The University of Reading, Reading, UK.
    tel. +44 (0) 118 378 7327
    web page:>

    Symposium Executive-Officer and OC member: Dr. Yasemin J. Erden, CBET,
    St Mary's University College, Twickenham, UK.
    tel: +44 (0) 208 224 4250
    web page:

    Symposium OC Member: Prof. Mark Bishop, Department of Computing,
    Goldsmiths, University of London, London, UK.
    tel: +44 (0) 207 078 5048
    web page:

    Symposium OC member: Prof. Slawomir J Nasuto, School of Systems
    Engineering, University of Reading, Reading, UK.
    tel: +44 (0) 118 378 6701
    web page:



    Dr Mark Coeckelbergh (University of Twente, NL)
    Prof. S. Barry Cooper (University of Leeds, UK)
    Dr. Anthony Galton (University of Exeter, UK)
    Dr Bob Kentridge (Durham University, UK)
    Dr Stephen Rainey (St Mary's University College, UK)
    Dr Mark Sprevak (University of Edinburgh, UK)
    Prof. Michael Wheeler (University of Stirling, UK)

    6 ) Master in Pure and Applied Logic, Barcelona (Spain)

    (From Joost Joosten)


    Master in Pure and Applied Logic, Barcelona (Spain)

    The biannual two-year 'Master in Pure and Applied Logic' programme for 2014-2016, jointly organized by the University of Barcelona and Polytechnical University of Catalunya, is open for (pre) registration.

    The Barcelona Logic Master caters in the most central aspects of advanced logic. Professors related to the Barcelona Master in Pure and Applied Logic come from various prominent Universities and Research Institutes in the area of Barcelona.

    Interested students can find more information at 
    Questions, also questions related to scholarships, housing etc., can be sent to Ramon Jansana

    With kind regards,

    Joost J. Joosten
    Dept. LÃ?²gica, HistÃ?²ria i Filosofia de la CiÃ?¨ncia.
    Universitat de Barcelona
    Montalegre, 6
    08001 Barcelona
    Phone: +34 622221327
    Office:  +34 934037984

    Phone: +34 622221327
    Office:  +34 934037984

    7 ) BCTCS 2014: Theoretical Computer Science, Loughborough (U.K.), 9-11 Apr 2014


    30th British Colloquium for Theoretical Computer Science (BCTCS)

    9th to 11th April 2014
    Loughborough University


    The purpose of the BCTCS is to provide a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers. The conference will consist of invited presentations by distinguished researchers and a number of contributed talks.


    BCTCS 2014 will be held at Loughborough University, which enjoys a central location in the UK and is well connected to most of the UK by rail, road or by plane. Various types of reasonably priced accommodation will be available on campus with easy access to the conference venue as well as the town center and restaurants.

    The event will start on the Wednesday afternoon and will end after a conference lunch on the Friday.


    BCTCS 2014 will include invited lectures by the following distinguished speakers:

    * Leszek Gasieniec (Liverpool)
    * Achim Jung (Birmingham)
    * Timo Koetzing (Jena)
    * Jeffrey Shallit (Waterloo) LMS-sponsored Keynote Speaker in Discrete Mathematics


    Participants at the colloquium are encouraged to present a contributed talk. Abstracts of contributed talks can be uploaded when registering. The abstracts of accepted contributed talks will be published in the Bulletin of the European Association for Theoretical Computer Science (EATCS).


    It is anticipated that a substantial number of bursaries for research students will be available. The bursaries are intended to cover registration, accommodation, meals, 1 year's EATCS membership, and reasonable travel costs. Those enrolled as research students may apply for these bursaries on the registration form after 13th January 2014.


    Registration will open on 13th January 2014 on the colloquium website. Details of the cost of registration will be available on the website before this date.


    The conference is being organised by Paul Bell and Daniel Reidenbach of the Department of Computer Science, Loughborough University.

    More information about the meeting including updates are available from the conference webpages at:

    Queries can be sent to:

    We hope to see you in Loughborough in 2014!


    > The fourth conference in the series COMPUTABILITY THEORY AND
    > FOUNDATIONS OF MATHEMATICS will take place at the Tokyo Institute of
    > Technology, Tokyo, Japan, February 17 - 20, 2014.
    > The theme of the CTFM conference series is the interplay between
    > computability theory and logical foundations of mathematics. The
    > scope includes topics such as Computability Theory, Reverse
    > Mathematics, Nonstandard Analysis, Proof Theory, Constructive
    > Mathematics, Theory of Randomness, and Computational Complexity. CTFM
    > 2014 will feature special sessions on Reverse Mathematics, Algorithmic
    > Randomness, and Recursion Theory.
    > CTFM acknowledges support from the research project Philosophical
    > frontiers in Reverse Mathematics granted by John Templeton Foundation
    > and partial support from JSPS-FWO Bilateral Programs, Joint Research
    > Projects between Tohoku University and Ghent University.
    > For more information, see

    9 ) Call for Nominations for EATCS Fellows 2014, Deadline: 31 Dec 2013


    Please note: all nominees and nominators must be EATCS Members

    Submit by December 31 of the current year for Fellow consideration by
    email to the EATCS Secretary ( The subject line
    of the email should read "EATCS Fellow Nomination - ".


    The EATCS Fellows Program is established by the Association to
    recognize outstanding EATCS Members for their scientific achievements
    in the field of Theoretical Computer Science. The Fellow status is
    conferred by the EATCS Fellows-Selection Committee upon a person
    having a track record of intellectual and organizational leadership
    within the EATCS community. Fellows are expected to be ?model
    citizens? of the TCS community, helping to develop the standing of TCS
    beyond the frontiers of the community.

    In order to be considered by the EATCS Fellows-Selection Committee,
    candidates must be nominated by at least four EATCS Members.
    Please verify your membership at

    The EATCS Fellows-Selection Committee consists of

    - Rocco De Nicola (IMT Lucca, Italy)
    - Paul Goldberg (Oxford, UK)
    - Anca Muscholl (Bordeaux, France, chair)
    - Dorothea Wagner (Karlsruhe, Germany)
    - Roger Wattenhofer (ETH Zurich, CH)


    A nomination should consist of answers to the questions below. It can
    be co-signed by several EATCS members. At least two nomination letters
    per candidate are recommended. If you are supporting the
    nomination from within the candidate's field of
    expertise, it is expected that you will be specific about the
    individual's technical contributions.

    To be considered, nominations for 2014 must be received by December 31, 2013.

    1. Name of candidate
    Candidate's current affiliation and position
    Candidate's email address, postal address and phone number
    Nominator(s) relationship to the candidate

    2. Short summary of candidate's accomplishments (citation -- 25 words or less)

    3. Candidate's accomplishments: Identify the most important
    contributions that qualify the candidate for the rank of EATCS Fellow
    according to the following two categories:

    A) Technical achievements
    B) Outstanding service to the TCS community

    Please limit your comments to at most three pages.

    4. Nominator(s):
    Affiliation(s), email and postal address(es), phone number(s)

    10 ) Call for Workshops - Cellular Automata for Research and Industry 2014

    ACRI2014 Krakow Poland

    Call for Workshops Proposals

    The ACRI-2014 Organizing Committee invites proposals for the Workshops Program to be held on September 22, 2014 immediately prior to the main ACRI Conference. The main goal of the ACRI-2014 Workshops Program is to stimulate and facilitate discussion, interaction, and comparison of approaches, methods, and ideas related to specific topics, both theoretical and applied, in the area of Cellular Automata focused on topics which, in time, aggregates international devoted communities.
    The ACRI-2014 Workshops will provide an informal setting where participants will have the opportunity to discuss specific technical topics in an atmosphere that fosters the active exchange of ideas.
    In the past editions of ACRI the number of ACRI Workshops and satellite Workshop has grown: C&CA (Crowds & Cellular Automata), T&CA (Traffic & Cellular Automata), Asynchronous Cellular Automata), CACGI (Cellular Automata of Cancer Growth and Invasion), IWNC (International Workshop of Natural Computing).

    Members from all areas of the ACRI community are invited to submit workshop proposals for review. Workshops on new and emerging topics, applications, and on broader topics of interest to a wider community are particularly encouraged. Workshops can vary in length, but most will be one full day in duration. Workshop organizers and attendees must register for their workshop and preferably also for the main ACRI conference. Attendance is limited to registered participants.

    The papers presented to the Workshop will be published in special session of the ACRI Proceedings. As in previous editions, special issues of International Journals have been published after a selection and a reviewed submission.

    Important Dates

    January, 9, 2014 Proposal Submission Deadline
    January, 14 2014 Notification of Selected Workshops
    January 21, 2014 Deadline for posting Workshop Call for Papers
    ACRI-2014 Workshop Program Announced (after reviewing process and final submissions ? May 30 2014)
    March 9 2014 Recommended deadline for Workshop Submissions
    April 12 2014 Recommended deadline for Workshop Notification
    Deadline for complete workshop notes submission to the workshop chairs
    May 15 2014 Deadline for posting Workshop Call for Participation
    September 22, 2014: ACRI-2014 Workshops

    Requirements for Submission

    Proposals for Workshops should be a maximum of 5 (fives) pages in length and should contain the following information:

    1. Title of the Workshop.

    2. A technical description of the workshop, specifying the workshop goals, the technical issues that it will address, and the relevance of the workshop to the main conference.

    3. A discussion of why and to whom the workshop is of interest.

    4. A list of related workshops held within the last three years, if any, and their relation to the proposed workshop. Information about previous offerings of the proposed workshop: when and where it has been offered in the past (i.e., with ACRI or another conference), organizers names and affiliations, number of submissions, acceptances and registered attendees, and follow-up publications, if any (e.g., journal special issues).

    5. A preliminary workshop agenda and a proposed schedule for organizing the workshop. This should include a brief description of how the organizers intend to encourage an atmosphere appropriate for a workshop.

    6. Description of the paper review process and acceptance standards.

    7. The names, affiliations and email addresses of the proposed workshop organizing committee. This committee should consist of three or four people knowledgeable about the technical issues to be addressed. The organizing committee should include individuals from multiple institutions.

    8. The name of the primary contact for the organizing committee (this person must reply promptly to email messages).

    9. List of potential program committee members, including their affiliations.

    10. Expected duration of the workshop (half or a full day).

    11. A list of places (distribution lists, web sites, journals, etc.) where the workshop is planned to be advertised.

    All proposals should be submitted by electronic mail, to the ACRI-2014 Workshop Chair email address ( as soon as possible and no later than January 9 2014.

    The selection of the workshops to be included in the final ACRI program will be done by the general chairs of ACRI 2014 based on the advice of the workshop chairs. The selection is based upon multiple factors, including: the scientific/technical interest of the topics, the clarity of the proposal in addressing the requested information, the innovative character of workshop topics, the cross-disciplinary nature of the workshop, the proposed tutorial session, and the capacity of the conference workshop program.

    Responsibilities of ACRI and Workshop Organizers

    For all accepted proposals, ACRI will be responsible for:
    - Providing publicity for the workshop series as a whole.
    - Providing logistic support and a meeting place for the workshop.
    - Together with the organizers, determining the workshop date and time.
    - ACRI reserves the right to cancel workshops, for example in case of low number of registrants. In such case, accepted submissions can be transferred to the main track of ACRI.

    Workshop organizers will be responsible for:
    - Setting up a website for the workshop.
    - Advertising the workshop and issuing a call for papers (by January 21, 2014) and a call for participation (by June 4, 2014).
    - Collecting and evaluating submissions, notifying authors of acceptance or rejection on a timely basis, and ensuring a transparent and fair selection process.
    - All workshop organizers are strongly advised to adopt the same deadlines for paper submissions and notifications of acceptance.

    Please send proposals and inquiries to the ACRI-2014 Workshops Chair:

    Stefania Bandini
    Complex Systems & Artificial Intelligence Research Center
    University of Milano-Bicocca
    Milano (ITALY)

    11 ) Algebra and Mathematical Logic: Theory and Applications, Kazan, June 2-6 2014

    International Conference


    Kazan, June 2-6, 2014


    Kazan Federal University and Tatarstan Republic Academy of Science
    organize an International Conference "Algebra and Mathematical Logic:
    Theory and Applications" dedicated to 80-th anniversary of Department
    of Algebra of Kazan University and to 70-th anniversary of Professor
    M.M. Arslanov.

    The meeting will be held in Kazan (Russia), June 2-6, 2014. The main
    topics of the conference include (but are not limited to) Lie
    Algebras, Group Theory, Ring Theory, Algebraic Geometry, Universal
    Algebra, Model Theory, Mathematical Logic, Computability Theory,
    Algebraic and Logic Methods in Computer Science.

    The Program Committee of the conference consists of academician Yu. L.
    Ershov - Chairman, I.Sh. Kalimullin (Kazan) - Vice-chairman, Chairman
    of the Organizing ?ommittee, A.N. Frolov (Kazan) - Secretary of the
    conference, Yu.A. Alpin (Kazan), K. Ambos-Spies (Heidelberg, Germany),
    M.M. Arslanov (Kazan), V.A. Artamonov (Moscow), S.B. Cooper (Leeds,
    UK), S.S. Goncharov (Novosibirsk), C. Jockusch (Urbana-Champaign,
    USA), N.G. Khisamiev (Ust-Kamenogorsk, Kazakhstan), B. Khoussainov
    (Auckland, New Zealand), J. Knight (South Bend, USA), M.I. Kuznetsov
    (Nizhny Novgorod), V.N. Latyshev (Moscow), S. Lempp (Madison, USA),
    V.M. Levchuk (Krasnojarsk), A.A. Makhnev (Ekaterinburg), V.D. Mazurov
    (Novosibirsk), A. Montalban (Berkeley, USA), R.Sh. Omanadze (Tbilisi,
    Georgia), R.A. Shore (Ithaca, USA), S.M. Skryabin (Kazan), R.I. Soare
    (Chicago, USA), S.N. Tronin (Kazan), S.V. Vostokov (St. Petersburg),
    Y. Yang (Singapore, Singapore).

    Invited speakers (on October 20, 2013, the list is updating): K.
    Ambos-Spies (Heidelberg University, Germany), V.A. Artamonov (Moscow
    State University), S.B. Cooper (Leeds Universtity, UK), Yu.L. Ershov
    (Sobolev Institute of Mathematics), A.N. Frolov (Kazan Federal
    University), S.S. Goncharov (Sobolev Institute of Mathematics), I.Sh.
    Kalimullin (Kazan Federal University), N.G. Khisamiev (East Kazakhstan
    Technical State University, Kazakhstan),

    B. Khoussainov (University of Auckland, New Zealand), J. Knight
    (University of Notre Dame, USA), V.N. Latyshev (Moscow State
    University, S. Lempp (University of Wisconsin, USA), R.Sh. Omanadze
    (Tbilisi State University, Georgia), Y. Yang (National University of
    Singapore, Singapore).

    The scientific program of the conference includes invited plenary
    lectures and contributed talks.

    The official webpage of the conference:
    English version:

    All necessary information can be found at this webpage.

    To participate at the conference you need proceed the registration
    (see "Registration" at the webpage).

    All your questions you may address to the secretary of the conference

    e-mail: - Secretary of the conference Frolov Andrey

    phone: (843) 233-70-39.

    Important dates:

    Deadline for submissions of abstracts: March 1, 2014

    Notification to authors: March 10, 2014

    Conference: June 2 - 6, 2014

    After the conference (on June 7) an excursion to the ancient city
    Bolghar (Volga Bulgaria) will be organized.

    The Organizing Committee

    12 ) Mathematical Structures of Computation, Lyon (France), 13 Jan - 14 Feb 2014
      Second call-for-participation and talk proposals
              Mathematical Structures of Computation
                  January 13 - February 14 2014
                          Lyon, France
    In short:
    - A call for talk proposals for the workshops 4 and 5,
    "Formal Proof, Symbolic Computation and Computer Arithmetic"
    and "Concurrency, Logic and Types"
    is open until Dec 20, 2013 (extended deadline)
    (for the modalities see the pages
    - Registration for each of the 5 workshops is possible until January 4, 2014.
    The programme proposes five consecutive workshops
    1. Recent Developments in Type Theory, January 13-17.
    2. Algebra and Computation, January 20-24.
    3. Directed Algebraic Topology and Concurrency, January 27-31.
    4. Formal Proof, Symbolic Computation and Computer Arithmetic,
    February 3-7.
    5. Concurrency, Logic and Types, February 10-14.
    Information on the programme can be found at
    Registration for one or several of these workshops is free, but
    recommended, and can be performed until *Jan. 4, 2014* on the following page:

    The weeks Mathematical Structures of Computation are organised in Lyon
    with the support of the Labex MILYON - Mathematics and fundamental
    computer science in Lyon.
    Together with the trimester Semantics of proofs and certified
    mathematics organised at Institut Henri Poincaré, Paris
    ( they constitute a French
    Semester on certified mathematics, programming languages and the
    mathematical structures of computation.
    The organisers
    Patrick Baillot, Yves Guiraud, Philippe Malbos.

    13 ) PhD position in algorithms and complexity at KTH Royal Institute of Technology, Stockholm

    The Theoretical Computer Science group at KTH Royal Institute of
    Technology invites applications for a PhD position in Theoretical
    Computer Science (Algorithms & Complexity).

    We are seeking a PhD student in Theoretical Computer Science for the
    research project ?Trading Time for Approximation in Optimization? in
    the areas of approximation algorithms and exact algorithms.

    The application deadline is January 31, 2014. See for the full, formal
    announcement with more information and instructions for how to
    apply. Informal enquiries about this position are welcome and may be
    sent to Per Austrin (

    Best regards,
    Per Austrin