[FOM] CiE Newsletter No.66, February 13, 2013

Olivier Bournez martin at eipye.com
Wed Feb 13 19:06:37 EST 2013

CiE Newsletter No.66, February 13, 2013.

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


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

** CIE 2013 http://cie2013.disco.unimib.it/
Computability in Europe 2013: The Nature of 
Computation. Milano. 1st-5th July 2013.


	•	1) CCA 2013 Second call for papers
	•	2) LICS 2013 - Second Call for Workshop Proposals
	•	3) Post-doc in quantum information in Grenoble
	•	4) VI International Workshop on Nature 
Inspired Cooperative Strategies for Optimization - NICSO 2013
	•	5) UCNC 2013: Submission deadline extended to 17 February 2013
	•	7) Conference announcement QI 2013 Leicester
	•	8) 2nd Call for papers: Machines, Computations and Universality 2013
	•	9) BCTCS: British Colloquium for Theoretical 
Computer Science, Bath (U.K.), 24-27 March 2013
	•	11) Announcement: CCR 2013
	•	12) Post-doc position in Oxford
	•	13) ELC Tokyo Complexity Workshop
	•	14) HaPoC 2013: History and Philosophy of 
Computing, Paris (France), 28-31 Oct 2013
	•	16) Reachability Problems (RP'13) - Uppsala, Sweden
	•	17) Fundamentals of Computation Theory (FCT) 2013 -- Liverpool University
	•	18) DICE 2013 - call-for partcipation
	•	19) 2nd Call for Papers: NUMTA2013 
International Conference and Summer School
	•	20) STACS 2013, 2nd call for participation
	•	21) [CCA] Call for Submissions: LMCS Special 
Issue CCA 2012, extension of deadline


1) CCA 2013 Second call for papers

                                                Second Call for Papers

Tenth International Conference on Computability 
and Complexity in Analysis (CCA 2013) will take 
place in Nancy, France, July 8 ? 11, 2013 (http://cca-net.de/cca2013).

The CCA 2013 Program Committee cordially invites 
researchers in the area of computability and 
complexity theory to submit papers for presentation at the conference.

	•	Computable analysis
	•	Complexity on real numbers
	•	Constructive analysis
	•	Domain theory and analysis
	•	Theory of representations
	•	Computable numbers, subsets and functions
	•	Randomness and computable measure theory
	•	Models of computability on real numbers
	•	Realizability theory and analysis
	•	Reverse analysis
	•	Real number algorithms
	•	Implementation of exact real number arithmetic


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



Submission deadline: April 1, 2013
Notification of authors: May 6, 2013
Registration deadline: May 20, 2013
Final version: May 27, 2013

Invited Speakers:
	•	Ulrich Berger (Swansea, UK)
	•	Takayuki  Kihara (JAIST, Japan)
	•	Cristobal Rojas (Toronto, Canada)
	•	Daniel Roy (Cambridge, UK)
	•	Martin Ziegler (Darmstadt, Germany)

Program Committee:
	•	Andrej Bauer (Ljubljana, Slovenia)
	•	Arno Pauly (Cambridge, UK)
	•	Hannes Diener (Siegen, Germany)
	•	Cameron Freer (MIT, USA)
	•	Laurent Bienvenu (Paris, France)
	•	Akitoshi Kawamura (Tokyo, Japan)
	•	Ker-I Ko (Stony Brook, USA)
	•	Matthias Schröder (Vienna, Austria)
	•	Robert Rettinger (Hagen, Germany)
	•	Ning Zhong, chair (Cincinnati, USA)
Local Organizers:
	•	Anne-Lise Charbonnier
	•	Hugo Férée
	•	Emmanuel Hainry
	•	Mathieu Hoyrup (chair)
	•	Emmanuel Jeandel
	•	Romain Péchoux


2) LICS 2013 - Second Call for Workshop Proposals
           Second Call for Workshop Proposals
                        LICS 2013
28th ACM/IEEE Symposium on Logic In Computer Science


The twenty-eighth ACM/IEEE Symposium on Logic In Computer Science
(LICS 2013) will be held in New Orleans, USA, 25--28 June 2013. It
will be colocated with MFPS (Mathematical Foundations of Programming
Semantics) and CSF (IEEE Computer Security Foundations). Possible
dates for workshops are Monday 24 June, Friday 28 June afternoon, and
Saturday 29 June.

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 usually 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!
- Let us know if you would like your workshop to be a joint
workshop with CSF. In that case you should submit to both.
- 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 should be submitted via Easychair at

Important dates:
   Submission deadline: February 15, 2013
   Notification: February 25, 2013
   Program of the workshops ready:  April 30, 2013
   Workshops: June 24, 2013 or June 28-29, 2013
   LICS conference: June 25-28, 2013

The workshops selection committee consists of the LICS General Chair
(Luke Ong), LICS Workshops Chair (Patricia Bouyer-Decitre), LICS 2013
PC Chair (Orna Kupferman) and LICS 2013 Conference Chair (Mike Mislove).

3) Post-doc in quantum information in Grenoble
A post-doc position is available at University of Grenoble.
The position is funded by the ANR research grant 
Causality in Quantum Information, see 

Topics that are of particular interest to us 
include (but do not limit yourself to these):
- Non-locality
- Quantum Cellular Automata
- Quantum Walks for quantum simulation
- Measurement-based quantum computation
- Secret-sharing protocols
- Regge calculus and connections with quantum gravity

Do not hesitate to ask for more details: "Mehdi 
Mhalla" <mehdi.mhalla at imag.fr>, "Simon Perdrix" 
<Simon.Perdrix at imag.fr>, "Pablo Arrighi" <pablo.arrighi at imag.fr>,.


4) VI International Workshop on Nature Inspired 
Cooperative Strategies for Optimization - NICSO 2013
(From Antonio D. Masegosa)

The VI International Workshop on Nature Inspired 
Cooperative Strategies for Optimization - NICSO 2013
September 2nd - 4th, 2013
Canterbury, United Kingdom


Full paper submission: April 15, 2013
Acceptance notification: May 15, 2013
Final camera ready: June 5, 2013
NICSO: September 2-4, 2013

NICSO 2013 will be the sixth edition of the 
International Workshop on Nature Inspired 
Cooperative Strategies for Optimization. This 
workshop aims at bringing together international 
researchers and practitioners from different 
disciplines in order to discuss recent advances 
and exchange ideas on the current state of the 
art of cooperative problem solving strategies.

All submitted papers will be blind reviewed by at 
least two reviewers from the Program Committee. 
Selection criteria will be based on relevance, 
originality, significance, impact, technical 
soundness and quality of the presentation. 
Contributions are expected to provide original 
results, insights and experimental innovations. 
Manuscripts must be in PDF, not exceeding 12 
pages and conforming to the Latex template at 
Instructions for Authors page for the book series 
Studies in Computational Intelligence 
Contributions are welcome to submission through 
the system available at http://www.easychair.org/conferences/?conf=nicso2013

The accepted papers will be published in the book 
(Springer) (http://www.springer.com/series/7092) 
indexed by ISI Web of Science Conference 
Proceedings, DBLP, Ulrichs, SCOPUS, MathSciNet, 
Current Mathematical Publications, Mathematical 
Reviews, Zentralblatt Math: MetaPress and Springerlink.

The authors of a selection of the best accepted 
papers will be invited to revise and extend their 
contributions for publication in a special issue 

Target topics (but not limited to):

Adaptive Behaviour
Ants Colonies
Amorphous Computing
Artificial Life
Artificial Immune Systems
Bio-inspired architecture
Complex Systems
Distributed Computing
Evolutionary Algorithms
Evolutionary Robotics
Evolvable Systems
Games and Game Theory
Genetic Algorithms
Genetic Programming
Membrane Computing
Memetic Algorithms
Quantum Computing
Software Self-Assembly
Systems Biology
Systems Coevolution
Swarm Intelligence

* Programme Committee *

Alex Freitas,University of Kent,UK
AndrÈs R. Masegosa,University of Granada,Spain
BelÈn Melian, University of La Laguna, Spain
Blas J. Galv·n, University of Las Palmas de Gran Canaria, Spain
Carlos Cruz Corona,University of Granada,Spain
Carlos GarcÌa MartÌnez,Univeristy of CÛrdoba,Spain
Cecilio Angulo, Technical University of Catalunya, Spain
Christof Teuscher,Portland State University,US
Colin Johnson,University of Kent,UK
Dario Landa-Silva,University of Nottingham,UK
Enrique Onieva,University of Granada,Spain
Evelyne Lutton, INRIA, France
Francisco Herrera, University of Granada, Spain
Gabriela Ochoa, University of Stirling, UK
Gianluigi Folino, Istituto di Calcolo e Reti ad Alte Prestazioni, Italy
Gisele Pappa,Universidade Federal de Minas Gerais,Brazil
Giuseppe Scollo, University of Catania, Italy
J. Marcos Moreno, University of La Laguna, Spain
Jaume Bacardit, University of Nottingham, UK
Jean-Louis Giavitto, UniversitÈ d'Evry, France
Jim Smith, University of the West of England, UK
Jon Timmis, University of York, UK
Jorge Casillas,University of Granada,Spain
JosÈ A. Moreno, University of La Laguna, Spain
JosÈ Alejandro Castillo, Instituto Nacional de 
Investigaciones Nucleares,Mexico
JosÈ Luis Verdegay, University of Granada, Spain
JosÈ Manuel Cadenas, University of Murcia, Spain
Juan JosÈ Merelo, University of Granada, Spain
Marco Dorigo, UniversitÈ Libre de Bruxelles, Belgium
MarÃŒa Teresa Lamata, University of Granada, Spain
Mario Pavone, University of Catania, Italy
Oliver Korb, Cambridge Crystallographic Data Centre,Germany
Paolo Arena, University of Catania, Italy
RenÈ Doursat,Complex Systems Institure,France
Roberto Battiti, University of Trento, Italy
Shengxiang Yang, University of Leicester,UK
Stefano Pizzuti, Energy, New Technologies & Envir. Agency, Italy
Steven Gustafson, General Electric Global Research Center, US
Thomas Stibor, GSI Helmholtz Centre for Heavy Ion Research,Germany
Vincenzo Cutello, University of Catania, Italy
Vitorino Ramos, Technical University of Lisbon, Portugal
Vittorio Maniezzo, University of Bologna, Italy
Xiao-Zhi Gao, Helsinki University of Technology, Finland

* Workshop Organizers *

Fernando Esteban Barril Otero
German Terrazas
Antonio D. Masegosa

* Steering Committee *

Natalio Krasnogor
David A. Pelta


5) UCNC 2013: Submission deadline extended to 17 February 2013
Due to many requests, we have extended the UCNC 2013 submission deadline
to 17 February 2013.

                 12th International Conference on

                             UCNC 2013

                previously Unconventional Computation

                           1-5 July 2013
                           Milano, Italy

                     ucnc2013 at disco.unimib.it

Important dates

* Submission deadline: 17 February 2013 (extended)
* Notification to authors: 25 March 2013
* Final version: 1 May 2013
* Conference: 1-5 July 2013

UCNC 2013 is organised by Dipartimento di Informatica,
Sistemistica e Comunicazione (Department of Computer Science,
Systems and Communication) of Università degli Studi di


The topics of the conference include all areas of unconventional
computation and natural computation, including (but not limited
to) quantum, cellular, molecular, neural, DNA, membrane, and
evolutionary computing; cellular automata; computation based on
chaos and dynamical systems; massive parallel computation;
collective intelligence; computation based on physical principles
such as relativistic, optical, spatial, collision-based
computing; amorphous computing; physarum computing;
hypercomputation. Both theoretical and experimental papers are


Authors are invited to submit original papers (at most 12 pages
in LNCS format) using EasyChair.org, at


Papers must be submitted in Portable Document Format (PDF). The
revised version of the manuscripts, to appear in a LNCS volume by
Springer, must be prepared in LaTeX according to the LNCS format
(see http://www.springer.com/computer/lncs/ lncs+authors).

The papers must not have been submitted simultaneously to other
conferences with published proceedings. All accepted papers must
be presented at the conference.

The proceedings will be available at the conference venue.

Authors of accepted papers will be invited to submit an extended
and improved version of their contribution to a special issue of
an international journal.

Invited speakers

* Enrico Formenti (Université Nice Sophia Antipolis, France)
* John V. Tucker (Swansea University, UK)
* Xin Yao (University of Birmingham, UK)

Joint UCNC/CiE 2013 invited speakers

* Gilles Brassard (Université de Montréal, Canada)
* Grzegorz Rozenberg (Universiteit Leiden, Netherlands and
   University of Colorado Boulder, USA)
* Endre Szemerédi (Hungarian Academy of Sciences, Hungary and
   Rutgers University, USA)

Program committee

* Andrew Adamatzky (University of the West of England, UK)
* Selim G. Akl (Queen's University, Canada)
* Olivier Bournez (École Politechnique, France)
* Cristian S. Calude (University of Auckland, New Zealand)
* José Félix Costa (Techinical University of Lisbon, Portugal)
* Erzsébet Csuhaj-Varjú (Eötvös Loránd University, Hungary)
* Alberto Dennunzio (Università degli Studi di Milano-Bicocca,
* Michael J. Dinneen (University of Auckland, New Zealand)
* Marco Dorigo (Université Libre de Bruxelles, Belgium)
* Jérôme Durand-Lose (Université d'Orléans, France)
* Oscar H. Ibarra (University of California, Santa Barbara, USA)
* Masami Hagiya (University of Tokyo, Japan)
* Jarkko Kari (University of Turku, Finland)
* Lila Kari (University of Western Ontario, Canada)
* Viv Kendon (University of Leeds, UK)
* Giancarlo Mauri (chair, Università degli Studi di
   Milano-Bicocca, Italy)
* Mario J. Pérez-Jiménez (Universidad de Sevilla, Spain)
* Kai Salomaa (Queen's University, Canada)
* Hava Siegelmann (University of Massachusetts Amherst, USA)
* Susan Stepney (University of York, UK)
* Hiroshi Umeo (Osaka Electro-Communication University, Japan)
* Leonardo Vanneschi (Universidade Nova de Lisboa, Portugal)
* Damien Woods (California Institute of Technology, USA)

Organising committee

* Alberto Dennunzio (Università degli Studi di Milano-Bicocca,
* Luca Manzoni (Università degli Studi di Milano-Bicocca, Italy)
* Giancarlo Mauri (chair, Università degli Studi di
   Milano-Bicocca, Italy)
* Antonio E. Porreca (Università degli Studi di Milano-Bicocca,

Satellite workshops:
* BioChemIT2013 (Third COBRA Workshop on Biological and Chemical
   Information Technologies)
* CoSMoS 2013 (6th Complex Systems Modelling and
   Simulation Workshop)
* Wivace 2013 (Workshop Italiano di Vita Artificiale e
   Computazione Evolutiva 2013 - Italian Workshop on Artificial
   Life and Evolutionary Computation 2013)

The UCNC 2013 conference will be co-located with Computability in
Europe 2013 (CiE 2013, http://cie2013.disco.unimib.it).

The conference and the satellite workshops will take place at
the U6 building of Università degli Studi di Milano-Bicocca,
Piazza dell?Ateneo Nuovo 1, Milano.

The previous editions of the conference took place at Auckland,
New Zealand (UMC 1998); Brussels, Belgium (UMC 2000); Kobe, Japan
(UMC 2002); Seville, Spain (UC 2005); York, UK (UC 2006);
Kingston, Canada (UC 2007); Vienna, Austria (UC 2008); Ponta
Delgada, Portugal (UC 2009); Tokyo, Japan (UC 2010); Turku,
Finland (UC 2011); Orleans, France (UCNC 2012).


The Logic Colloquium 2013 (ASL European Summer Meeting) will take place
for the first time in Portugal, in Évora,  one of Portugal?s most
beautifully preserved medieval towns, which was declared World Heritage
by the UNESCO in 1986, on July 22-27, 2013. The Logic Colloquium is the
annual European conference on Logic, organised under the auspices of the
Association for Symbolic Logic (ASL) and provides a forum for presenting
and discussing the new developments in the area of Logic, including
Mathematical logic, Computer science logic and Philosophical logic. The
scientific program of the Logic Colloquium 2013 is composed of  very
important invited speakers including a Fields Medalist (Mathematics Nobel
prize) and a CNRS Silver Medalist.

Submission for Contributed talks is now open and the call for ASL travel
grants and ASL-NSF travel grants is also open. Registration will open
soon. For further details see the meeting web page:

Please forward this message to everyone you know. Don't forget anyone!

The organizing committee.


7) Conference announcement QI 2013 Leicester

Seventh International Quantum Interaction Symposium (QI' 2013)

25th - 27th July 2013

University of Leicester - UK

Please visit: http://www.physics.le.ac.uk/qi2013/

and also: http://www.quantuminteraction.org/conferences

After highly successful previous meetings

· QI'2007, Stanford,

· QI'2008, Oxford,

· QI'2009, Saarbrücken,

· QI'2010, Washington DC,

· QI'2011, Aberdeen,

· QI'2012, Paris

the Seventh International Quantum Interaction 
Symposium will take place at the University of 
Leicester, Leicester, UK from July 25- July 27 - 2013.


Over the last six years, the Quantum Interaction 
conferences have provided for a debating ground 
on applications of quantum mechanical formalisms 
to a variety of areas outside of the natural 
remit of quantum physics such as information 
retrieval in computer science; decision making in 
a variety of social science fields (such as 
Economics and Psychology) and Biology and other 
fields of inquiry (like Linguistics). The 
foundational issues on quantum physics form an 
integral part of the intellectual exchange 
delivered at the Quantum Interaction conferences.

This year a special session will be devoted to 
debating what we can learn about quantum theory 
from other areas where similar structures are encountered.

Aims and Scope

This symposium will bring together researchers 
interested in how QI interfaces can be applied 
directly to solve problems in domains beyond 
quantum physics more efficiently or to address previously unsolved problems.

Papers addressing one or more of the following broad content areas are welcome:

· Information processing and retrieval

· Semantic representation and processing

· Logic and epistemology

· Cognition and Brain (memory, cognitive processes, consciousness)

· Decision theory (political, psychological, 
cultural, organizational, social, etc.)

· Game theory

· Finance, economics, and social structures 
(e.g., organizations, institutions, cultures)

· Artificial Intelligence (Logic, planning, agents and multi-agent systems)

· Biological systems

Papers that address the application of the 
following QI topics to modelling cognitive, 
social, and semantic processes for artificial 
intelligence will be considered favourably:

· Vector methods (beyond just proximity)

· Entanglement (i.e., non-separability arising from product structures)

· Non-classical probabilistic models

· Projection and non-commutativity

· Operators as predicates

· Quantization

· How do we get from (apparently) continuous 
stimuli to clearly discrete expressions?

· How does collapse happen?

· How does the future (a range of 
potentialities) become the past (one outcome has 
been selected and cannot change)?

· Normalization and expectation

· Prediction

Amongst the keynote speakers for QI'2013 we will 
have Serge Galam (CREA - Ecole Polytechnique/CNRS 
- France). Other keynote speakers will be announced soon.

The post-conference proceedings of QI'2013 will 
be published by Springer Verlag in its Lecture 
Notes in Computer Science (LNCS) series. Authors 
will be required to submit a final version 14 
days after the conference to reflect the comments 
made at the conference. We will also consider 
organizing a special issue for a suitable journal 
to publish selected best papers.

Important Dates

1st April 2013: Deadline for paper submission
8th May 2013: Notification of acceptance
30th May 2013: Deadline for early bird conference fee
15th June 2013: Submission of camera ready paper
25th - 27th July: Conference


Authors are invited to submit research papers of 
up to 12 pages (LONG papers) or 6 pages (SHORT 
papers). All submissions should be prepared in 
English using the LNCS template, which can be downloaded from


Please submit online at:



Steering Committee:

· Peter Bruza (Computer Science; Queensland 
University of Technology, Australia)

· Trevor Cohen (Biomedical Informatics; University of Texas, USA)

· Bob Coecke (Computer Science; Oxford University, UK)

· Andrei Khrennikov (Mathematics; Linnaeus University, Sweden)

· Ariane Lambert-Mogiliansky (Economics; Paris School of Economics, France)

· Dominic Widdows (Microsoft, USA)

General Chairs:

· Derek Raine (Physics; University of Leicester, UK)

· Emmanuel Haven (School of Management; University of Leicester, UK)

Programme Committee Chairs:

· Harald Atmanspacher (Physics; Institute for 
Frontier Areas of Psychology - Freiburg, Germany 
and Collegium Helveticum - ETH Zürich, Switzerland)

· Kirsty Kitto (Computer Science; Queensland 
University of Technology, Australia)

8) 2nd Call for papers: Machines, Computations and Universality 2013
Machines, Computations and Universality (MCU) 2013, the 6th conference
in the MCU series, will be hosted at the University of Zurich on
September 9-12, 2013.



MCU explores computation in the setting of various discrete models
(Turing machines, register machines, cellular automata, tile assembly
systems, rewriting systems, neural models etc.) and analog and hybrid
models (BSS machines, infinite time cellular automata, real machines,
quantum computing etc.). There is particular (but not exclusive)
emphasis given towards the following:

1. the search for frontiers between decidability and undecidability in
the various models. (For example, what is the smallest number of pairs
of words for which the Post correspondence problem is undecidable, or
what is the largest state-symbol product for which the halting problem
is decidable for Turing machines?)

2. the search for the simplest universal models (such as small universal
Turing machines, universal rewriting systems with few rules, universal
cellular automata with small neighborhoods and a small number of states,

3. the computational complexity of predicting the evolution of
computations in the various models. (For example, is it possible to
predict an arbitrary number of time steps for a model more efficiently
than explicit step by step simulation of the model?)

4. universality and undecidability in continuous models of computation.


Submission: March 31, 2013
Notification: May 17, 2013
Final Version: June 14, 2013
Conference: September 9-12, 2013


Andrew Adamatzky        (University of the West of England, UK)
Matthew Cook            (University of Zurich and ETH Zurich) (co-chair)
Erzsébet Csuhaj-Varjú   (Eötvös Loránd University, Budapest, Hungary)
Jérôme Durand-Lose      (University of Orléans, France)
Rudolf Freund           (University of Vienna, Austria)
Gabriel Istrate         (Institute e-Austria, Timisoara, Romania)
Jarkko Kari             (University of Turku, Finland)
Lila Kari               (University of Western Ontario, London, Canada)
Kamala Krithivasan      (Indian Institute of Technology, Chennai, India)
Maurice Margenstern     (University of Lorraine, France)
Turlough Neary          (University of Zurich and ETH Zurich) (co-chair)
Matthew Pattitz         (University of Arkansas, Fayetteville, USA)
Igor Potapov            (University of Liverpool, UK)
Klaus Sutner            (Carnegie Mellon University, Pittsburgh, USA)
Sergey Verlan           (University of Paris Est, France)
Damien Woods            (California Institute of Technology, USA)


Liesbeth De Mol     (Ghent University, Belgium)
Jarkko Kari         (University of Turku, Finland)
Kenichi Morita      (Hiroshima University, Japan)
Erik Winfree        (California Institute of Technology, USA)
Damien Woods        (California Institute of Technology, USA)


Maurice Margenstern     (University of Lorraine, France) (chair)
Jérôme Durand-Lose      (University of Orléans, France) (vice-chair)
Erzsébet Csuhaj-Varjú   (Eötvös Loránd University, Hungary)
Natasha Jonoska         (University of South Florida, USA)
Kenichi Morita          (Hiroshima University, Japan)
Gheorghe P?un           (The Romanian Academy, Romania)
Arto Salomaa            (University of Turku, Finland)
K. G. Subramanian       (University of Science, Malaysia)


Authors are invited to submit extended abstracts of no more than 12
pages via the EasyChair system at
https://www.easychair.org/conferences/?conf=mcu2013. Submissions should
contain original research that has not previously been published.
Concurrent submissions to other conferences/journals is not permitted.
Supplementary material that exceeds the 12 page limit will be considered
at the committee?s discretion. Submissions must be in the form of a PDF
prepared using the EPTCS style file (available at
http://style.eptcs.org/). The title page should include the title of the
paper, the names, affiliations and email addresses of each of the
authors, and an abstract of no more than 300 words.


The proceedings will be published in Electronic Proceedings in
Theoretical Computer Science (EPTCS) and will be available at the
conference, and freely available online. For more information see the
EPTCS website at http://about.eptcs.org/.

Following, the conference, authors of selected papers will be invited to
submit an extended version of their work to a special issue of an
international journal.


9) BCTCS: British Colloquium for Theoretical 
Computer Science, Bath (U.K.), 24-27 March 2013
British Colloquium for Theoretical Computer Science
Bath, UK
24th-27th March 2013


Deadline for application for bursaries: 28th February 2013
Deadline for abstract submission: 10th March 2013
Deadline for registration: 10th March 2013

The 29th British Colloquium for Theoretical Computer Science will be
hosted by the Department of Computer Science, University of Bath,
from 24th to 27th March 2013.

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

25 fully-funded PhD Student Bursaries are available, covering UK
travel, accommodation at University rate, and full registration.
It is easy to apply for one. Please see the website for details. We
are grateful to the Heilbronn Institute for Mathematical Research for
sponsoring these bursaries.

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

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

Susanne Albers, Humboldt-Universität zu Berlin, the LMS-sponsored
keynote speaker in Discrete Mathematics

Samson Abramsky, University of Oxford

Assia Mahboubi, École Polytechnique, Paris

plus a representative of Altran UK; details to be announced.

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

Further details are available from the Colloquium website:

Important dates:

18th January 2013 --- Registration/accommodation booking open
28th February 2013 --- Deadline for application for bursaries
10th March 2013 --- Abstract submission deadline for participants
wishing to give contributed talks.
10th March 2013 --- Deadline for registration.
24th--27th March 2013 --- Colloquium.

19th International Workshop on
Cellular Automata and Discrete Complex Systems

September 17 - 19, 2013, Giessen, Germany


* Submission deadline (full papers): April 15, 2013
* Submission deadline (exploratory papers): July 15, 2013
* Notification to authors (full papers): June 10, 2013
* Final version: July 8, 2013
* Conference: September 17 - 19, 2013


Papers presenting original and unpublished research on all
fundamental aspects of cellular automata and related discrete
complex systems are sought. Topics of interest include (but are
not limited to): dynamics, topological, ergodic and algebraic
aspects, algorithmic and complexity issues, emergent properties,
formal language processing, symbolic dynamics, models of
parallelism and distributed systems, phenomenological
descriptions, scientific modeling and practical applications.
Papers authored or co-authored by PC members are welcome and
will follow a specific evaluation process.


There are two paper categories - full and exploratory
contributions. Full papers are meant to report more complete and
denser research, while the later submission deadline of
exploratory papers allows quick reporting of most recent
discoveries, work-in-progress and/or partial results. Papers in
the full paper category are refereed and selected by the program
committee. Papers in the exploratory category go through a less
rigorous evaluation for suitability. Full papers receive a longer
time slot for presentation in the workshop.


Papers have a page limit of 14 pages (full paper category) or
8 pages (exploratory paper category), they must be formatted in
LaTeX using the LNCS format
(see http://www.springer.com/computer/lncs/lncs+authors),
and must be submitted in Portable Document Format (PDF). Authors
are invited to submit original papers using EasyChair.org, at


The submission may contain an appendix that exceeds the page
limit if the author wants to provide the PC with more details
than allowed by the strict paper limit. The appendix will not
be published in the proceedings. The papers must not have been
submitted simultaneously to other conferences with published
proceedings. All accepted papers must be presented at the


Papers in the full paper category will be published in the
LNCS series of Springer and the proceedings will be available
at the conference venue. Exploratory papers will be published
in local proceedings and will be also available at the conference.

Authors of selected papers will be invited to submit an extended
and improved version of their contribution to a special issue of
the Journal of Cellular Automata and another international journal
depending on the number and the subject of the papers accepted.

The workshop will host the annual meeting of the IFIP Working
group 1.5 on  Cellular Automata and Discrete Complex Systems.


* Nazim Fates (Inria Nancy Grand-Est, France)
* Enrico Formenti (University of Nice Sophia Antipolis, Nice, France)
* Pedro de Oliveira (Mackenzie Presbyterian University, Sao Paulo,


* Bruno Durand (University of Montpellier 2, Montpellier, France)
* Paola Flocchini (University of Ottawa, Ottawa, Canada)
* Anahi Gajardo (University of Concepcion, Concepcion, Chile)
* Eric Goles (Adolfo Ibanez University, Chile)
* Pierre Guillon (University of Aix-Marseille, Marseille, France)
* Rolf Hoffmann (Technical University Darmstadt, Darmstadt, Germany)
* Jarkko Kari (University of Turku, Turku, Finland) co-chair
* Martin Kutrib (University of Giessen, Giessen, Germany) co-chair
* Danuta Makowiec (Gdansk University, Gdansk, Poland)
* Andreas Malcher (University of Giessen, Giessen, Germany) co-chair
* Bruno Martin (University of Nice Sophia Antipolis, Nice, France)
* Genaro Martinez (National Polytechnic Institute, Mexico city,
* Kenichi Morita (Hiroshima University, Hiroshima, Japan)
* Hidenosuke Nishio (Kyoto University, Kyoto, Japan)
* Ferdinand Peper (National Institute of Information and
Communications Technology, Japan)
* Victor Poupet (University of Marseille, Marseille, France)
* Kai Salomaa (Queen's University, Kingston, Canada)
* Klaus Sutner (Carnegie Mellon University, Pittsburgh, USA)
* Veronique Terrier (University of Caen, Caen, France)
* Hiroshi Umeo (Osaka Electro-Communication University, Osaka, Japan)
* Thomas Worsch (Karlsruhe University, Karlsruhe, Germany)

11) Announcement: CCR 2013
(From Noam Greenberg)

The Eighth International Conference on 
Computability, Complexity and Randomness (CCR 
2013) will be held in Moscow, at the Poncelet 
lab, from the 23rd to the 27th of September 2013.


The conference, previously also known as the 
conference on Logic, Computability and 
Randomness, will be in the tradition of the 
previous meetings Cordoba, Buenos Aires, Nanjing, 
Luminy, Notre Dame, Cape Town, and Cambridge.
Topics covered include:

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

Authors are invited to submit an abstract in PDF 
format of typically about 1 or 2 pages via the following web page:


The deadline for submissions is 15th May 2013. No 
full papers will be required for this conference. 
After the deadline for submissions has expired, 
submissions may still be accepted for reviewing 
at the discretion of the PC chair.

Invited speakers include

* Edward Hirsch
* Emmanuel Jeandel
* Jan Reimann
* Laurent Bienvenu
* Yang Yue

The programme committee consists of Eric Allender 
(Rutgers, USA), Mark Braverman (Princeton, USA), 
Vasco Brattka (Munich, Germany), Willem Fouche 
(Pretoria, South Africa), Noam Greenberg, chair 
(Wellington, New Zealand), Mathieu Hoyrup (Nancy, 
France), Andre Nies (Auckland, New Zealand), 
Theodore Slaman (Berkeley, USA), and Frank Stephan (Singapore).

The local organizing committee consists of 
Michael Raskin, Andrei Romashchenko, Alexander 
Shen, and Nikolai K. Vereshchagin (chair).

The CCR Steering committee consists of Veronica 
Becher (Buenos Aires, Argentina), Laurent 
Bienvenu (Paris, France), Rod Downey, chair 
(Wellington, New Zealand), Denis Hirschfeldt 
(Chicago, United States), Elvira Mayordomo 
(Zaragoza, Spain), Wolfgang Merkle (Heidelberg, 
Germany), Nikolai K. Vereshchagin (Moscow, 
Russia), and Liang Yu (Nanjing, China).


12) Post-doc position in Oxford
A post-doc position is available in the quantum group in the Computer
Science Department, University of Oxford.


Samson Abramsky


13) ELC Tokyo Complexity Workshop
(From Akitoshi Kawamura)

Call for Participation
March 14-17, 2013
Shinagawa Prince Hotel, Tokyo, Japan
ELC (Exploring the Limits of Computation) is a five-year project
started in 2012 in Japan, focusing on various aspects of
computational complexity theory.  As a kickoff event of this
project, we are planning to have a workshop during March 14-17 in
Tokyo, inviting the following distinguished speakers.  We welcome
any of you interested in computational complexity theory to
participate in this workshop.  We are planning also some satellite
seminars before and after the workshop.
February 28, 2013
Eric Allender (Rutgers University)
Irit Dinur (The Weizmann Institute of Science)
Zeev Dvir (Princeton University)
Joshua A. Grochow (The University of Toronto)
Rahul Jain (National University of Singapore)
Valentine Kabanets (Simon Fraser University)
Shachar Lovett (University of California, San Diego)
Pinyan Lu (Microsoft Research Asia and Shanghai Jiao Tong University)
Raghu Meka (Institute for Advanced Study and DIMACS)
Ketan Mulmuley (University of Chicago)
Noam Nisan (Hebrew University of Jerusalem)
Ryan O'Donnell (Carnegie Mellon University)
Pavel Pudlak (The Academy of Sciences of the Czech Republic)
Ran Raz (The Weizmann Institute of Science)
Rocco Servedio (Columbia University)
Luca Trevisan (Stanford University)
Umesh Vazirani (UC Berkeley)
Yuichi Yoshida (National Institute of Informatics)
David Zuckerman (University of Texas at Austin)


14) HaPoC 2013: History and Philosophy of 
Computing, Paris (France), 28-31 Oct 2013
28th - 31st October 2013
Ecole Normale Superieure, Paris.
with a special session on "Computing and the Arts" at Ecole Nationale
Superieure des Arts Decoratifs

We are happy to announce that the 2nd International Conference on the
History and Philosophy of Computing (HaPoC 2013) will take place from
the 28th to the 31st of October 2013 at the Ecole Normale Superieure in
Paris (France).
The birth of the computing and its sciences has often been the topic of
philosophical and historical reflection. The HaPoC-conferences have
decided to bring together the historical and the philosophical
viewpoints. They want to create an environment for a true
interdisciplinary convergence around computer science, reenforcing
research on the science(s) of computing and its history and stimulating
a theoretical dialogue between these domains. To furter this dialogue
HaPoC has chosen to have no parallel sessions.
Our invited speakers are: Janet Abbate; Bernard Chazelle (tbc); Walter
Dean; Nathan Ensmenger; Jean-Yves Girard; Barbara Liskov (tbc); Margit
Rosen and Franck Varenne. HaPoC 2013 is the follow-up conference to
HaPoC 2011 (Gent, Belgium).
Please check out the website of HaPoC 2013 for more information on the

For HaPoC 2013 we welcome contributions from logicians, philosophers and
historians of computing as well as from philosophically aware computer
scientists and mathematicians. Topics include but are not limited to:
1. Approaches to the notion of computing
	a. History and Philosophy of Computability
	b. History and Philosophy of Computation
	c. History and Philosophy of Programming
	d. History and Philosophy of the Computer
2. Applications and uses of Computing
	a. History and Epistemology of the use of Computing in the sciences
	b. Computing and the Arts : historical and conceptual issues
	c. Social, ethical and paedagogical aspects of Computing

We cordially invite researchers working in a field relevant to the main
topics of the conference to submit a short abstract of approximately 200
words and an extended abstract of at most a 1000 words (references
included) to


Abstracts must be written in English and anonymized. Please note that
the format of uploaded files must be .pdf or .doc.

The submission deadline is: April 30th, 2013

Best regards,
the organisers,

Maarten Bullynck (Paris 8 & SPHERE)
Jean-Baptiste Joinet (Lyon 3, IRPhil & CIRPHLES)


                                 CSL 2013
                             	COMPUTER SCIENCE LOGIC 2013
                                Torino, September 2-5 2013


first call-for-papers

Computer Science Logic (CSL) is the annual conference of the European
Association for Computer Science Logic (EACSL).
The conference is intended for computer scientists whose research
activities involve logic, as well as for logicians working on
issues significant for computer science.

The 22nd EACSL Annual Conference on Computer Science Logic will be held
at Museo di Scienze Naturali in Torino from
Monday 2nd through Thursday 5th of September 2013.

automated deduction and interactive theorem proving, constructive
mathematics and type theory, equational logic and term rewriting,
automata and games, game semantics, modal and temporal logic, model
checking, decision procedures, logical aspects of computational
complexity, computational proof theory, bounded arithmetic and
propositional proof complexity, logic programming and constraints, lambda
calculus and combinatory logic, domain theory, categorical logic and
topological semantics, database theory, specification, extraction and
transformation of programs, logical aspects of quantum computing, logical
foundations of programming paradigms, verification and program analysis,
linear logic, higher-order logic, non-monotonic reasoning.

Nachum Dershovitz (Tel Aviv)
Jean Yves Girard (Marseille)
Isabel Oitavem (Lisboa)
Lidia Tendera (Opole)

PierGiorgio Odifreddi (Torino) welcome talk

Abstract submission: April, 1st 2013
Paper Submission: April, 8th 2013
Paper Notification: June, 10th 2013
Paper final version: July, 1st 2013
Conference: September, 2nd --- 5th 2013

Authors are invited to submit papers of not more than 15 pages in LIPIcs
style presenting work not previously published.
Papers are to be submitted through Easychair, at the address:
Submitted papers must be in English and must provide sufficient detail to
allow the PC to assess the merits of the paper. Full proofs may appear in
a technical appendix which will be read at the reviewers' discretion.
Authors are strongly encouraged to include a well written introduction
which is directed at all members of the program committee.
The submission is in two stages. Abstract submissions are due before
April 1st, 2013. Full paper submissions must be done before April 8th,
Papers must not be submitted concurrently to another conference with
refereed proceedings. The PC chair should be informed of closely related
work submitted to a conference or a journal by March 24th, 2013. Papers
authored or co-authored by members of the Programme Committee are not

- Ackermann Award 2013, for PhD dissertations in topics specified by
EACSL and LICS conferences.
- International summer school on ?Linear logic and related topics?
(August 28 - 31).
- 14th International Workshop on Logic and Computational Complexity
(LCC'13) (September 6).
- 9th International Workshop on Fixed Points in Computer Science
(FICS'13) (September 1).

Zena Ariola (University of Oregon)
Arnon Avron (Tel-Aviv University)
Roberto Bagnara (University of Parma, and BUGSENG srl)
Christel Baier (Technical University of Dresden)
Marc Bezem (University of Bergen)
Paola Bruscoli (University of Bath, Computer Science Department)
Agata Ciabattoni (TU Wien)
Thierry Coquand (Chalmers University)
Ugo Dal Lago (Università di Bologna)
Valeria De Paiva (Nuance Communications)
Reinhard Kahle (CENTRIA and DM, UNL, Portugal)
Stephan Kreutzer (Technical University Berlin)
Olivier Laurent (CNRS - ENS Lyon)
Carsten Lutz (Universität Bremen)
Jean-Yves Marion (Université de Lorraine, LORIA)
Damian Niwinski (Warsaw University)
Frank Pfenning (Carnegie Mellon University)
Elaine Pimentel (UFMG)
Ruzica Piskac (Max Planck Institute for Software Systems (MPI-SWS))
Simona Ronchi Della Rocca CHAIR (Università di Torino)
Jan Rutten (CWI)
Helmut Schwichtenberg (LMU Munich)
Phil Scott (Dept. of Math & Stats, U. Ottawa)
Peter Selinger (Dalhousie University)
Makoto Tatsuta (National Institute of Informatics)
Tachio Terauchi (Nagoya University)

Erika De Benedetti (Dipartimento di Informatica, Torino)
Paola Giannini (Dipartimento di Scienze e Innovazione Tecnologica
(DISIT), Alessandria)
Mauro Piccolo (Dipartimento di Informatica, Torino)
Luca Padovani (Dipartimento di Informatica, Torino)
Luca Paolini (Dipartimento di Informatica, Torino)
Simona Ronchi Della Rocca (Dipartimento di Informatica, Torino)
Luca Roversi (Dipartimento di Informatica, Torino)
Angelo Troina (Dipartimento di Informatica, Torino)


16) Reachability Problems (RP'13) - Uppsala, Sweden
R E A C H A B I L I T Y     P R O B L E M S    2013
The 7th International Workshop on Reachability Problems (RP2013)
   (25 - 27 September 2013, University of Uppsala, Sweden)

The Department of Information Technology will organize the 7th International
Workshop on Reachability Problems (RP'2013). This event will take place at
Norrlands nation in the heart of central Uppsala, 25 - 27 September 2013.

Papers presenting original contributions related to reachability problems
in different computational models and systems are being sought.
This will also be the occasion to review recent breakthroughs by
renown invited experts and survey emerging trends and emphasize
on key open challenges. Participants are kindly encouraged to discuss
on core scientific issues that need to be further tackled.

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

Invited Speakers:

- Patricia Bouyer-Decitre (Cachan, France)
- Daniel Kroening (Oxford, UK)
- Rupak Majumdar (MPI-SWS, Germany)
- Shaz Qadeer (Microsoft Research Redmond, USA)
- Thomas Schwentick (TU Dortmund University, Germany)


Papers presenting original contributions related to
reachability problems in different computational
models and systems are being sought.

Topics of interest include (but are not limited to):
Reachability for infinite state systems, rewriting
systems; Reachability analysis in counter/ timed/
cellular/ communicating automata; Petri-Nets;
computational aspects of semigroups, groups and
rings; Reachability in dynamical and hybrid systems;
frontiers between decidable and undecidable
reachability problems; complexity and decidability aspects;
predictability in iterative maps and new computational paradigms

Authors are invited to submit a draft of a full paper with
at most 12 pages (in LaTeX, formatted according to LNCS guidelines)
via the conference web page.
Proofs omitted due to space constraints must be put into an
appendix to be read by the program committee members at their discretion.
Submissions deviating from these guidelines risk rejection.
Electronic submissions should be formatted in pdf.
Simultaneous submission to other  conferences or workshops
with published proceedings is not allowed.

Important Dates

- Submission deadline: 24 May 2013
- Notification to authors: 2 July 2013
- Final version: 12 July 2013
- Workshop: 25 - 27 September 2013


The Conference Proceedings will be published
as the volume of the Springer Verlag LNCS
(Lecture Notes in Computer Science) series and
distributed at the Conference. We plan also to publish
selected papers in a special issue of a high quality journal
following the regular referee procedure.

RP2013 Program Committee:

Parosh Aziz Abdulla (co-chair), Uppsala University
Rajeev Alur, University of Pennsylvania
Mohamed Faouzi Atig, Uppsala University
Bernard Boigelot, University of Liege
Ahmed Bouajjani, LIAFA, University Paris Diderot
Krishnendu Chatterjee, Institute of Science and Technology
Giorgio Delzanno, DIBRIS, Università di Genova
Javier Esparza, Technische Universität München
Alain Finkel, ENS Cachan
Pierre Ganty, IMDEA Software Institute
K. Narayan Kumar, Chennai Mathematical Institute
Kim Guldstrand Larsen, Aalborg University
Jerome Leroux, CNRS-LABRI
Richard Mayr, University of Edinburgh
Markus Müller-Olm, Wilhelms-Universität Münster
Andreas Podelski, University of Freiburg
Igor Potapov (co-chair), University of Liverpool
Jean-Francois Raskin, Université Libre de Bruxelles
Ahmed Rezine, Linköping University
James Worrell, Oxford University
Hsu-Chun Yen, National Taiwan University
Gianluigi Zavattaro, Università di Bologna

Organizing Committee:

Parosh Aziz Abdulla (co-chair), Uppsala University
Mohamed Faouzi Atig (co-chair), Uppsala University
Carl Leonardsson, Uppsala University
Igor Potapov (co-chair), University of Liverpool
Jari Stenman, Uppsala University
Othmane Rezine, Uppsala University

17) Fundamentals of Computation Theory (FCT) 2013 -- Liverpool University
   FCT 2013, University of Liverpool

The 19th International Symposium on Fundamentals of Computation
Theory (FCT 2013) will be hosted by the Department of Computer
Science at the University of Liverpool.

Dates:  Aug 19-21, 2013
Website:  http://fct2013.csc.liv.ac.uk/

Submission deadline:  Apr 23, 2013

Invited Speakers

Marek Chrobak, University of California, Riverside
Joel Ouaknine, Oxford University
David Peleg, Weizmann Institute

Program chairs:  Leszek Gasieniec, University of Liverpool
                           Frank Wolter, University of Liverpool

Conference proceedings will be published by Springer in the
"Lecture Notes in Computer Science" series.

Conference scope
FCT covers

   Algorithms, including algorithm design, optimization,
approximation and randomized algorithms, computational
complexity, computational geometry, machine learning, artificial
intelligence, computational algebra, online algorithms,
and parallel and distributed computing.

   Formal methods, including algebraic and categorical
methods, automata and formal languages, database theory,
foundations of concurrency, logic and model checking,
principles of programming languages, program analysis
and transformation, specification, refinement and verification,
and security.

   Emerging fields, including algorithmic game theory,
computational biology, foundations of cloud computing, and
quantum computing.


18) DICE 2013 - call-for partcipation
2013    §§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§


March 16,17 2013
event of ETAPS 2013

for participation


submission:            January 10, 2013
notification:             January 25, 2013
final version due:    February 14, 2013


		? Jean-Yves Marion (Loria - INPL Nancy)
		? Marko van Eekelen (Open University - Radboud University Nijmegen)
		? Paul-André Melliès (PPS, Paris)


The area of Implicit Computational Complexity 
(ICC) has grown out from several proposals
to use logic and formal methods to provide 
languages for complexity-bounded computation
(e.g. Ptime, Logspace computation). It aims at 
studying computational complexity without
referring to external measuring conditions or a 
particular machine model, but only by
considering language restrictions or 
logical/computational principles implying complexity properties.
This workshop focuses on ICC methods related to 
programs (rather than descriptive methods).
In this approach one relates complexity classes 
to restrictions on programming paradigms
(functional programs, lambda calculi, rewriting 
systems), such as ramified recurrence, weak
polymorphic types, linear logic and linear types, 
and interpretative measures. The two main
objectives of this area are:
		- to find natural implicit characterizations of 
various complexity classes of functions, thereby
                   illuminating their nature and importance;
		- to design methods suitable for static verification of program complexity.

Therefore ICC is related on the one hand to the 
study of complexity classes, and on the other
hand to static program analysis. The workshop 
will be open to contributions on various aspects
of ICC including (but not exclusively):
		- types for controlling complexity,
		- logical systems for implicit computational complexity,
		- linear logic,
		- semantics of complexity-bounded computation,
		- rewriting and termination orderings,
		- interpretation-based methods for implicit complexity,
		- programming languages for complexity-bounded computation,
		- application of implicit complexity to other 
programming paradigms  ?  (e.g. imperative or object-oriented languages).


An open call for post-proceedings, as special issue of
                                          INFORMATION & COMPUTATION
will follow.


? Roberto Amadio (Paris-Diderot)
? Harry Mairson (Brandeis)
? Virgile Mogbil (Paris 13)
? Simona Ronchi Della Rocca (Torino) (Chair)
? Luca Roversi (Torino)
? Olha Shkaravska (Nijmegen)
? Ulrich Schöpp (LMU)
? Aleksy Shubert (Warsaw)
? Jakob G. Simonsen (DIKU)


? Patrick Baillot (ENS Lyon, CNRS)
? Ugo Dal Lago (Università degli Studi di Bologna)
? Martin Hofmann (Ludwig-Maximilians-Universität München)
? Jean-Yves Marion (Loria - INPL Nancy)
? Simona Ronchi Della Rocca (Università degli Studi di Torino))



19) 2nd Call for Papers: NUMTA2013 International Conference and Summer School
(From Yaroslav D. Sergeyev)


Numerical Computations: Theory and Algorithms
International Conference and Summer School
(in cooperation with the Society for Industrial and Applied Mathematics SIAM)
June 17 - 23, 2013
Eurolido Hotel, Falerna (CZ)
Tyrrhenian Sea, Italy


The NUMTA2013 Conference is organized jointly by 
the University of Calabria, Department of 
Computer Engineering, Modelling, Electronics and 
Systems Science, Italy, and by the N.I. 
Lobachevsky State University of Nizhni Novgorod, 
Russia, in cooperation with the Society for 
Industrial and Applied Mathematics (SIAM), USA.

The goal of the Conference is to create a 
multidisciplinary round table for an open 
discussion on numerical modeling nature by using 
traditional and emerging computational paradigms. 
The Conference will discuss all aspects of 
numerical computations and modeling from 
foundations and philosophy to advanced numerical 
techniques. New technological challenges and 
fundamental ideas from theoretical computer 
science, linguistic, logic, set theory, and 
philosophy will meet requirements and new fresh 
applications from physics, chemistry, biology, and economy.

Researchers from both theoretical and applied 
sciences are very welcome to submit their papers 
and to use this excellent possibility to exchange 
ideas with leading scientists from different 
research fields. Papers discussing new 
computational paradigms, relations with 
foundations of mathematics, and their impact on 
natural sciences are particularly solicited. A 
special attention will be also dedicated to 
numerical optimization and different issues 
related to theory and practice of the usage of 
infinities and infinitesimals in numerical computations.

Together with regular presentations at the 
conference there will be the Summer School 
offering tutorials and discussion sections 
covering the topics of the Conference. To 
participate at the Summer School it is not 
required to submit a paper to the Conference. 
English is the working language both at the Conference and the Summer School.

A book of extended abstracts and a special issue 
of the prestigious international journal Applied 
Mathematics and Computation (Elsevier, Impact 
Factor: 1.317), dedicated to the Conference will be published.


Submission of one page abstracts: March 1, 2013
Notification of acceptance: March 15, 2013
Payment of the regular registration fee: March 30, 2013
Hotel reservation: May 5, 2013
Conference: June 17-23, 2013
Submission of papers to the special issue: October 31, 2013
Reviewing process: October 31, 2013 - October 31, 2014


- Approximation
- Bifurcation and stability of dynamical systems
- Cellular automata
- Computability and complexity
- Computation on infinite structures
- Computational biology and bioinformatics
- Computational chemistry
- Computational fluid dynamics
- Computational geometry
- Computational physics
- Computational statistics
- Constructive models
- Continuous optimization
- Difference equations
- Differential equations
- Discrete optimization
- Divergent series, integrals and processes
- Domain decomposition methods
- Dynamics and control of nonlinear systems
- Emerging computational paradigms
- Evolutionary methods
- Foundations of mathematics
- Fractals
- Fuzzy computation
- Global optimization
- Grossone infinity computing
- History of numerical computations
- Interval analysis
- Mathematical logic
- Modeling: continuous vs. discrete
- Models of computation
- Multi-objective control and optimization
- Natural computing
- Nonlinear dynamics and chaos
- Numbers and numeral systems
- Numerical economical models
- Numerical linear algebra
- Numerical modeling in physics
- Optimal control
- p-Adic analysis and applications
- Parallel and distributed computing
- Perturbation methods for nonlinear system analysis
- Philosophy of mathematics
- Quantum computing
- Singularities
- Theory of algorithms
- Universality and relativity in language and mathematics
- Variational analysis

NUMTA2013 PROGRAM COMMITTEE (not complete yet)

Andrew Adamatzky, Bristol, UK
Anthony Beavers, Evansville, USA
Jean Paul Van Bendegem, Brussel, Belgium
Olivier Bournez, Palaiseau, France
Luigi Brugnano, Florence, Italy
Oleg Burdakov, Linkoping, Sweden
Sergiy Butenko, College Station, TX, USA
Cristian Calude, Auckland, New Zealand
Gregory Chaitin, Rio de Janeiro, Brazil
S. Barry Cooper, Leeds, UK
Francesco Costabile, Rende, Italy
Lou D?Alotto, New York, USA
Renato De Leone, Camerino, Italy
Rentsen Enkhbat, Ulaanbaatar, Mongolia
Yuri Ershov, Novosibirsk, Russia
Yury Evtushenko, Moscow, Russia
David Yang Gao, Ballarat, Australia
Manlio Gaudioso, Rende, Italy
Franco Giannessi, Pisa, Italy
Sergio Greco, Rende, Italy
Vladimir Gurman, Pereslavl-Zalesski, Russia
Serife Faydaoglu, Izmir, Turkey
Valery Kozlov, Moscow, Russia
Daniel Krob, Paris, France
Hans Petter Langtangen, Oslo, Norway
Angelo Luongo, L?Aquila, Italy
Maurice Margenstern, Metz, France
Boris Mordukhovich, Detroit, USA
Panos Pardalos, Gainesville, USA
Ferdinand Peper, Kobe, Japan
Igor Pospelov, Moscow, Russia
Elemer Rosinger, Pretoria, South Africa
Valeria Ruggiero, Ferrara, Italy
Yaroslav Sergeyev, Rende, Italy
Khodr Shamseddine, Manitoba, Canada
Vladimir Shylo, Kiev, Ukraine
Domenico Talia, Rende, Italy
Igor Volovich, Moscow, Russia
Anatoly Zhigljavsky, Cardiff, UK
Antanas Zilinskas, Vilnius, Lithuania
Vladimir Zaborovsky, St. Petersburg, Russia
Joseph Zyss, Cachan, France


Andrew Adamatzky, Bristol, UK (Natural computing)
Luigi Brugnano, Florence, Italy (Recent advances in geometric integration)
Renato De Leone, Camerino, Italy (TBD)
Yuri Ershov, Novosibirsk, Russia (TBD)
Yury Evtushenko, Moscow, Russia (TBD)
David Yang Gao, Ballarat, Australia (TBD)
Maxim Kronhaus, Moscow, Russia (TBD)
Boris Mordukhovich, Detroit, USA (TBD)
Panos Pardalos, Gainesville, USA (TBD)
Igor Pospelov, Moscow, Russia (TBD)
Khodr Shamseddine, Manitoba, Canada (Levi-Civita fields)
Yaroslav Sergeyev, Rende, Italy (Grossone infinity computing: Foundations)
Sergey Shary, Novosibirsk, Russia (Foundations of interval analysis)
Igor Volovich, Moscow, Russia (TBD)
Anatoly Zhigljavsky, Cardiff, UK (TBD)
Joseph Zyss, Cachan, France (TBD)


The hotel: http://www.eurolido.it
Single room full pension 80 Euro. Double room full pension 60 Euro per
person.  The  hotel is very close to Lamezia Terme airport having both
normal and low cost connections (EasyJet, Ryanair).


20) STACS 2013, 2nd call for participation


30th International Symposium on Theoretical Aspects of Computer Science

February 27-March 2, 2013, Kiel, Germany



The 30th International Symposium on Theoretical 
Computer Science (STACS) will be held from 
February 27 to March 2, 2013 (Wednesday through 
Saturday), on the premises of the Christian-Albrechts-Universität zu Kiel.

The program, which is available at

  http://www.stacs2013/uni-kiel.de/ ,

is composed of 54 contributed and three invited talks as well as a tutorial.

- Kousha Etessami, University of Edinburgh
  The complexity of analyzing infinite-state 
Markov chains, Markov decision processes, and stochastic games
- Kurt Mehlhorn, MPI Saarbrücken and Saarland University
  Physarum can compute shortest paths
- Stéphan Thomassé, Ecole Normale Supérieure de Lyon
  Graph Coloring, Communication Complexity and the Stubborn Problem
- Dániel Marx, MTA SZTAKI, Hungarian Academy of Sciences (tutorial)
  Algorithmic Graph Structure Theory

Registration is through the conference website,

  http://www.stacs2013.uni-kiel.de/ .

For detailed information on STACS 2013, visit the conference website,

  http://www.stacs2013.uni-kiel.de/ .

Regular registration:        Jan 15 - Feb 14, 2013
Late registration:	    Feb 15 - Mar 2, 2013
Symposium:                   Feb 27 - Mar 2, 2013

info at stacs2013.uni-kiel.de

21) [CCA] Call for Submissions: LMCS Special 
Issue CCA 2012, extension of deadline

Call for Submissions for the Special issue of LMCS following

      Computability and Complexity in Analysis (CCA 2012)

Submission deadline: extended to 21 February 2013

The Ninth International Conference on

     Computability and Complexity in Analysis (CCA 2012)

took place in Cambridge, UK, 24-27 June 2012, see


Following this conference there will be a special issue of  the journal

     Logical Methods in Computer Science (LMCS),

which is an ISI listed open access journal, see


We invite submissions of original research papers in all CCA related
areas to this special issue. Papers not presented at CCA 2012 may
also be considered for submission. All papers will be refereed
according to the usual standards of a high-quality journal. Submitted
papers must not be previously published nor submitted for publication

Further technical instructions for the submission of papers are
included below!

Deadline for submission: 11 February 2013
Notification:            8 May 2013

Martín Escardó
Arno Pauly
Matthias Schröder
Klaus Weihrauch

(Guest Editors of the LMCS Special Issue)

Technical Instructions for Authors

1. Register as an author on the web page


    and enter the special issue code: 2-1,A:cC

    (In case you are already registered, go to "profile" and
     enter the above special code under "register for special

2. Go through the submission routine on the web page.
    In Step 0 choose the name of the meeting for which this
    special issue is being organized.

3. Authors should prepare their manuscripts using the style
    file requested by the journal upon submission. Please see
    the LMCS web page



More information about the FOM mailing list