CiE 2017: Call for Participation


CiE 2017: Unveiling Dynamics and Complexity
Turku, Finland
June 12-16, 2017

Computability in Europe 2017


Symposium “Magic in Science”, co-located with CiE 2017, dedicated to Grzegorz Rozenberg on the occasion of his 75th birthday takes place just after CiE, on June 17, 2017. Details below and at at



CiE 2017 is the thirteenth conference organized by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world.

Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte Dalgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015) and Paris (2016).


Department of Mathematics and Statistics, University of Turku
Computer Science, Ă…bo Akademi University


We are happy to announce that the CiE Women in Computability program, coordinated by the Special Interest Group Women in Computability offers four grants of up to 250 EUR for junior female researchers who want to participate in CiE 2017. Applications for this grant should be send to Liesbeth De Mol ( before 1 May 2017 and include a short cv (at most 2 pages) and contact information for an academic reference. Preference will be given to junior female researchers who are presenting a paper (including informal presentations) at CiE 2017.

CiE-SIG: Women in Computability


Denis R. Hirschfeldt (University of Chicago)
Daniel M. Gusfield (University of California, Davis)


Scott Aaronson (University of Texas at Austin)
Karen Lange (Wellesley College)
Ludovic Patey (Université Paris Diderot)
Nicole Schweikardt (Humboldt-Universit ät zu Berlin)
Alexander Shen (Université de Montpellier)
Moshe Vardi (Rice University)


Algorithmics for biology:

Organized by Paola Bonizzoni (Milano, Italy) and Veli Mäkinen (Helsinki, Finland). Speakers:

Tobias Marschall (Max-Planck-Institut fĂĽr Informatik)
Fabio Vandin (University of Padova)
Gregory Kucherov (University Paris-Est Marne-la-Vallée)
Gianluca Della Vedova (University of Milano-Bicocca)

Combinatorics and algorithmics on words:

Organized by Tero Harju (Turku, Finland) and Dirk Nowotka (Kiel, Germany). Speakers:

Stepan Holub (Charles University in Prague)
Pascal Ochem (Université de Montpellier)
Svetlana Puzynina (Sobolev Institute of Mathematics and École Normale Supérieure de Lyon)
Narad Rampersad (University of Winnipeg)

Computability in analysis, algebra, and geometry:

Organized by Julia Knight (Notre Dame, USA) and Andrey Morozov (Novosibirsk, Russia). Speakers:

Saugata Basu (Purdue University)
Margarita Korovina (University of Aarhus)
Alexander Melnikov (University of California, Berkeley)
Russell Miller (Queens College, City University of New York)

Cryptography and information theory:

Organized by Delaram Kahrobaei (New York, USA) and Helger Lipmaa (Tartu, Estonia). Speakers:

Jean-Charles Faugère (Université Pierre et Marie Curie)
Elham Kashefi (University of Edinburgh-Scotland, Université Pierre et Marie Curie)
Aggelos Kiayias (University of Edinburgh)
Ivan Visconti (UniversitĂ  degli Studi di Salerno)

Formal languages and automata theory:

Organized by Juhani Karhumäki (Turku, Finland) and Alexander Okhotin (St. Petersburg, Russia). Speakers:

Kai Salomaa (Queen’s University at Kingston)
Matrin Kutrib (Justus-Liebig-Universität Gießen)
Thomas Colcombet (Université Paris Diderot)
Artur Jez (University of Wrocław)

History and philosophy of computing:

Special topic: History and foundations of recursion, in memory of RĂłsza PĂ©ter (1905-1977)

Organized by Liesbeth De Mol (Lille, France) and Giuseppe Primiero (London, United Kingdom). Speakers:

Juliette Kennedy (University of Helsinki)
Jan von Plato (University of Helsinki)
Hector Zenil (University of Oxford, and Karolinska Institute)
Cliff Jones (Newcastle University)

The PROGRAM COMMITTEE consisted of:

Andrew Arana (Urbana-Champaign, US)
Arnold Beckmann (Swansea, UK)
Paola Bonizzoni (Milan, IT)
Olivier Bournez (Palaiseau, FR)
Vasco Brattka (Munich, DE)
Cristian S. Calude (Auckland, NZ)
Ann Copestake (Cambridge, UK)
Liesbeth De Mol (Lille, FR)
Helena Durnová (Brno, CZ)
Ekaterina Fokina (Vienna, AT)
Tero Harju (Turku, FI)
Emmanuel Jeandel (Nancy, FR)
Emil Jeřábek (Prague, CZ)
Natašha Jonoska (Tampa, US)
Jarkko Kari (Turku, FI, co-chair)
Viv Kendon (Durham, UK)
Takayuki Kihara (Berkley, US)
Florin Manea (Kiel, DE)
Klaus Meer (Cottbus, DE)
Russell Miller (New York City, US)
Bernard Moret (Lausanne, CH)
Rolf Niedermeier (Berlin, DE)
Dag Normann (Oslo, NO)
Dirk Nowotka (Kiel, DE)
Isabel Oitavem (Lisbon, PT)
Ion Petre (Turku, FI, co-chair)
Kai Salomaa (Kingston, CA)
Reed Solomon (Storrs, US)
Mariya Soskova (Sofia, BG)
Susan Stepney (York, UK)
Peter Van Emde Boas (Amsterdam, NL)
Philip Welch (Bristol, UK)
Damien Woods (Pasadena, US)

Magic in Science:

The symposium “Magic in Science” will be co-located with CiE 2017. It takes place on June 17, 2017, immediately after CiE. The symposium celebrates the 75th birthday of Prof. Grzegorz Rozenberg, University of Leiden, the Netherlands and University of Colorado at Boulder, USA. Grzegorz Rozenberg is one of the world leaders in research on Theoretical Computer Science and Natural Computing. As a matter of fact, he is often called the guru of Natural Computing, having started promoting it as a coherent scientific discipline already from the 1970s – he gave this area its name and defined its scope. He played a central role in the development of theoretical computer science in Europe. His research is very broad in scope and it is a prime example of interdisciplinary research. He has authored exceptionally many research papers opening new vistas, as well as well-known books about developmental languages, decidability and DNA computing. He supervised numerous Ph.D. students, many of whom have become known scientists. He serves or has served the international computer science community in numerous roles, including: president of the European Association for Theoretical Computer Science (EATCS); cofounder and president of the International Society for Nanoscale Science, Computation, and Engineering (ISNSCE); chair of the steering committee of the DNA Computing Conference; cofounder and chair of the steering committee of the International Conference on Application and Theory of Petri Nets; chair of the steering committee of the European Educational Forum; cofounder and chair of the steering committee of the International Conference on Developments in Language Theory; co-chair of the steering committee of the International Conference on Unconventional Computation and Natural Computation; and director of European Molecular Computing Consortium. The talks given at the symposium will have an overview character and together they will cover a broad range of topics from Computer Science, reflecting Grzegorz Rozenberg’s broad research interests. Among the topics covered are: P vs NP, reaction systems, membrane computing, graph isomorphism, combinatorics on words, DNA rearrangements, smart textiles, smart drones, magic squares, wonder cubes, and odor reproduction.

Confirmed speakers include: David Harel, Weizmann Institute of Science, Israel- “On odor reproduction and how to test for it” Hendrik Jan Hoogeboom, University of Leiden, the Netherlands – TBA Juraj Hromkovic, Swiss Federal Institute of Technology Zurich, Switzerland – “Why P vs. NP is so hard that even magicians failed to solve it” Natasha Jonoska, University of South Florida, USA – TBA Juhani Karhumäki, University of Turku, Finland – “Combinatorics on words and k-abelian equivalence” Hermann Maurer, Academia Europaea and Graz University of Technology, Austria: “Some unusual applications of computer science” George Paun, Institute of Mathematics of the Academy of Romania – TBA Azaria Paz, Technion, Israel – “Linked magic squares on a cube. Theme and variations” Moshe Vardi, Rice University, USA – “The Automated-Reasoning Revolution: From Theory to Practice and Back” The symposium is free of charge. Details:

Association CiE:
CiE Conference Series:
CiE 2017 on Facebook:
CiE 2017 on Twitter:

CiE 2017 on Instagram:

CiE17 Call for Informal Presentations

Call for informal presentations

Computability in Europe 2017, June 12-16, Turku, Finland

Important dates
• Submission deadline: May 1, 2017
• Notification of acceptance: Within two weeks of submission

There is a remarkable difference in conference style between computer science and mathematics conferences. Mathematics conferences allow for informal presentations that are prepared very shortly before the conference and inform the participants about current research and work in progress. The format of computer science conferences with pre-conference proceedings is not able to accommodate this form of scientific communication.

Continuing the tradition of past CiE conferences, also this year’s CiE conference endeavours to get the best of both worlds. In addition to the formal presentations based on our LNCS proceedings volume, we invite researchers to present informal presentations. For this, please send us a brief description of your talk (one page) by the submission deadline May 1st.

Please submit your abstract electronically, via EasyChair , selecting the category “Informal Presentation”.

You will be notified whether your talk has been accepted for informal presentation within two weeks after your submission.

Jarkko Kari and Ion Petre (PC co-chairs of CiE 2017)

CiE Day Lectures, Milan April 7, 2017

CiE Day Lectures in Milan
April 7, 2017
Dipartimento di Informatica, Sistemistica e Comunicazione dell’Università di Milano –Bicocca

Paola Bonizzoni
Raffaella Rizzi

The CiE Day Lectures in Milan is a series of seminars that reflect in the CiE spirit different ways in which computability emerges from the real world, and how this affects our way of thinking about everyday computational issues.

9.15 Opening (Paola Bonizzoni)

9.30 Continuous Time Models of Computation
Olivier Bournez
Department of Computer Science, Ecole Polytechnique (Paris-Saclay)

10.00 Provably total NP search problems in Bounded Arithmetic
Arnold Beckman
Department of Computer Science, College of Science, Swansea University

10.30 Handling Mobility Failures by Modal Types
Giuseppe Primiero
Department of Computer Science, Middlesex University London