CiE Newsletter No.30, March 16, 2010:
Another bumper list of exciting announcements! And the CiE 2010 Call for
Informal Presentations is due very soon.
___________________________________________________________________________
CONTENTS:
1. 5th Conference on the Theory of Quantum Computation, Communication and
Cryptography - TQC 2010
2. 14th Congress of Logic, Methodology and Philosophy of Science - Nancy
(France), 19-26 July, 2011
3. HyperNet 10: EXTENDED DEADLINE
4. MALOA PhD positions
5. Universal Machines and Computations 2010 - Extended Deadline
6. 11th Conference on Membrane Computing, 24/8-27/8, Jena, Germany
7. Asian Initiative for Infinity Graduate Summer School in Logic: 28 June-23
July 2010, National University of Singapore
8. DCM 2010 workshop at FLOC'10: 2nd Call for Papers
9. PAR'10 workshop at FLOC'10: 2nd Call for Papers
10. Funding opportunity - Foundational Questions
11. EmergeNET4: Engineering Emergence
===========================================================================
===========================================================================
1. (from Viv Kendon) Registration for 5th Conference on the Theory of
Quantum Computation, Communication and Cryptography - TQC 2010:
Dear colleagues,
we would like to remind you that TQC 2010 takes place just
over a month from now: if you haven't registered yet, please
do so by following the links at http://tqc2010.leeds.ac.uk
Invited speakers:
# Kae Nemoto (NII, Tokyo)
# Frank Verstraete (University of Vienna)
# Ronald de Wolf (CWI, Amsterdam)
# Anton Zeilinger (University of Vienna)
Accepted talks:
* Martin Aulbach, Damian Markham and Mio Murao:
The maximally entangled symmetric state in terms of the geometric
measure
* Mario Berta, Matthias Christandl and Renato Renner:
A Conceptually Simple Proof of the Quantum Reverse Shannon Theorem
* Dan Browne, Elham Kashefi and Simon Perdrix:
Computational depth complexity of measurement-based quantum
computation
* Andrew Childs and Robin Kothari:
Simulating sparse Hamiltonians with star decompositions
* Giulio Chiribella:
Optimal pure state estimation as a randomized universal cloning
* Carlo Di Franco, Mauro Paternostro and Myungshik Kim:
Bypassing state initialisation in perfect state transfer protocols on
spin-chains
* Libby Heaney:
Teleportation with mode entanglement of a single massive particle
* Benjamin Johnson:
The Polynomial Degree of Recursive Fourier Sampling
* Jeong San Kim and Barry C Sanders:
Monogamy of multi-qubit entanglement in terms of Renyi and Tsallis
entropies
* Matthew McKague and Michele Mosca:
Generalized self-testing and the security of the 6-state protocol
* Ashley Montanaro:
Quantum search with advice
* Bill Rosgen:
Testing non-isometry is QMA-complete
* Pradeep Sarvepalli and Robert Raussendorf:
Local Equivalence of Surface Code States
* Arleta Szkola and Michael Nussbaum:
Asymptotically optimal discrimination between pure quantum states
* Yasuhiro Takahashi:
Simple Sets of Measurements for Universal Quantum Computation and
Graph State Preparation
Also featuring:
** Poster session with best poster competition
sponsored by the Heilbronn Institute
http://www.maths.bris.ac.uk/research/heilbronn_institute/
** The 10th Symposium on Topological Quantum Information
will be held at the University of Leeds, UK,
on the 11th and 12th April 2010, directly before TQC 2010.
Participants of TQC are most welcome to attend the symposium too:
http://quantum.leeds.ac.uk/~phyjkp/TQC2010.htm
We look forward to welcoming you to Leeds!
Best wishes,
Viv Kendon (local organising committee chair)
Wim van Dam (programme committee chair)
Simone Severini (programme committee co-chair)
__________________________________________
TQC 2010 tqc2010@leeds.ac.uk
The fifth Conference on Theory of Quantum
Computation, Communication, & Cryptography
University of Leeds 13th-15th April 2010
http://tqc2010.leeds.ac.uk/
===========================================================================
===========================================================================
2. (from Pierre Edouard Bour) 14th Congress of Logic, Methodology and
Philosophy of Science - Nancy (France), 19-26 July, 2011:
ANNOUNCEMENT AND CALL FOR PRELIMINARY REGISTRATION
14th Congress of Logic, Methodology and Philosophy of Science
Location: Nancy, France
Date: 19-26 July, 2011
Website: http://www.clmps2011.org/
It is with pleasure that we announce the upcoming 14th Congress of
Logic, Methodology and Philosophy of Science, a leading congress in its
field, which will be held on July 19-26, 2011, in Nancy (France). The
Congress will feature more than 50 invited speakers, several plenary
symposia and lectures, as well as a general program for a wider
audience. For the first time in its history, the Congress presents a
special topic of interest that will be the focus of a series of lectures
and symposia:
"Logic and Science Facing the New Technologies"
The four main sections of the Congress will be:
A. Logic
B. General Philosophy of Science
C. Methodological and Philosophical Issues of Particular Sciences
D. Methodological and Philosophical Issues in Technology
Also for the first time, there will be a call for contributed symposia
in addition to the call for contributed papers. Both calls will be
issued on 1 June 2010, with 31 October 2010 being the submission deadline.
Further details can be found on the homepage of the Congress of Logic,
Methodology and Philosophy of Science at the following address:
http://www.clmps2011.org/
Please note the option to receive by e-mail further information by
signing up for the Congress newsletter at:
http://www.clmps2011.org/en/newsletter.html
The intention to attend the Congress and submit a contributed individual
paper or symposium proposal can be stated there as well. Although this
pre-registration is not mandatory, it would help the organizers to
acquire an early idea of what to expect.
We thank you in advance for forwarding this circular so that it can
reach the widest audience possible.
Gerhard Heinzmann (Chair Organizing Committee)
Peter Schroeder-Heister (Chair General Programme Committee)
===========================================================================
===========================================================================
3. (from Mike Stannett) HyperNet 10: EXTENDED DEADLINE:
EXTENDED DEADLINE: 5 APRIL 2010
HyperNet 10: The UC2010 Hypercomputation Workshop
http://hypercomputation.net/hypernet10/
This workshop is being organized as part of
Unconventional Computation 2010, Tokyo (21-25 June 2010)
UC10: http://arn.local.frs.riken.jp/UC10/
Original papers are solicited in all areas relating to hypercomputation
research. Typical topics include, but are not restricted to:
philosophical implications, justifications and analyses of
hypercomputation; hypercomputational models of Newtonian, quantum and
relativistic physics; mathematical models and representations of
hypercomputational systems; engineering challenges; proposals for going
beyond the Turing paradigm; digital physics and refutations of
hypercomputation.
Submissions:
Authors are invited to submit papers (no more than 12 pages) via EasyChair:
http://www.easychair.org/conferences/?conf=hypernet10
Papers should be submitted in PDF format. Joint submissions to other
conferences are not permitted. Each accepted paper must be presented at
the Workshop.
Submissions due: April 5th, 2010 (EXTENDED)
Notification: April 26th, 2010
Final versions due: May 20th, 2010
UC 2010 begins: June 21st, 2010
Papers for presentation will be selected by the Programme Committee,
comprising: Selim AKL, Hajnal ANDREKA, Cristian CALUDE, Barry COOPER,
Jack COPELAND, Francisco Antonio DORIA, Marian GHEORGHE, Mark HOGARTH,
Viv KENDON, Kenichi MORITA, Istvan NEMETI, Mike STANNETT, Susan STEPNEY,
Karl SVOZIL, Christof TEUSCHER, John TUCKER, Benjamin WELLS.
Registration: should be carried out via the main UC10 web site
(registration for UC10 includes registration for the Workshop). Workshop
enquiries may be addressed to hypernet10@easychair.org.
Background: HyperNet 10 is organized jointly by the University of Tokyo
in Japan, and members of the VT (Verification and Testing) Research
Group at the University of Sheffield, under the auspices of UC 2010 and
the EPSRC, and on behalf of the Hypercomputation Research Network.
Comprising researchers from around the world, the Network investigates
all aspects of hypercomputation, ranging from philosophy and logic to
physical feasibility and computability. Previous Network events include
the 2006 workshop on Future Trends in Hypercomputation (Sheffield, UK),
the 2009 conference on the Science and Philosophy of Unconventional
Computing (SPUC 09, Cambridge, UK), and the UC09 Hypercomputation
Workshop (Ponta Delgada, The Azores, Portugal).
===========================================================================
===========================================================================
4. (from Dugald MacPherson) MALOA PhD positions:
The EU network MALOA is now advertising the second batch of PhD positions.
There will be one in Leeds, one in each of Oxford, Manchester, Paris,
Munich, Muenster, and two in Lyon (the Prague job is filled). The closing
date for applications on the MALOA website
http://www.logique.jussieu.fr/MALOA/
is March 31, and the Leeds job will also be advertised this week on the
Leeds University website and jobs.ac.uk, with a one month deadline (so more
like April 8).
Anyone appointed has to start by 1 October if they are to get the full 36
months.
They are well-funded positions, with generous travel money in addition, and
we want strong applicants.
Thanks, Dugald
===========================================================================
===========================================================================
5. (from Maurice Margenstern) Universal Machines and Computations 2010 -
Extended Deadline:
CALL FOR PAPERS CALL FOR PAPERS CALL FOR PAPERS CALL FOR PAPERS
----------------------------------------------------------------------
International Conference
MACHINES ET CALCULS UNIVERSELS
UNIVERSAL MACHINES AND COMPUTATIONS
----------------------------------------------------------------------
M M CCC U U I 22222 00000 1 00000
MM MM C C U U I 2 2 0 0 11 0 0
M M M M C U U 2 2 0 0 1 1 0 0
M M M C U U 22 0 0 1 0 0
M M C U U 2 0 0 1 0 0
M M C C U U 22 0 0 1 0 0
M M CCC UUU 2222222 00000 1111 00000
----------------------------------------------------------------------
PITTSBURGH, PA, USA
Carnegie Mellon University
Department of Computer Science
---------
SEPTEMBER 21-25
-----------------------------------------------------------------------
Organizing institutions :
Carnegie Mellon University, Department of Computer Science
Universite d'Orleans, LIFO
Universite Paul Verlaine - Metz, LITA
-----------------------------------------------------------------------
EXTENDED DEAD-LINE
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
TOPICS :
Digital Computations:
Turing machines, register machines, cellular automata,
other automata, tiling of the plane, polyominoes, snakes,
neural networks, molecular computations, word processing
(goups and monoids), other machines
Analog and Hybrid Computations:
BSS machines, infinte cellular automata, real machines,
quantum computing
In both cases:
frontiers between a decidable halting problem and an
undecidable one in the various computational settings
minimal universal codes:
size of such a code, namely, for Turing machines, register
machines, cellular automatas, tilings, neural nets,
Post systems, ...
computation complexity of machines with a decidable halting
problem as well as universal machines
self-reproduction and other tasks
universality and decidability in the real field
PROGRAM COMMITTEE :
Erzsebet CSUHAJ-VARJU, Hungarian Academy of Sciences, Hungary
Jerome DURAND-LOSE, University of Orleans, France, co-chair
Vladik KREINOVICH, the University of Texas at El Paso
Maurice MARGENSTERN, LITA, University of Metz, France, co-chair
Cris MOORE, Santa Fe, USA
Gheorghe PAUN, Romanian Academy, Bucharest, Romania
Igor POTAPOV, University of Liverpool, UK
Yurii ROGOZHIN, Institute of Mathematics, Chisinau, Moldov
Klaus SUTNER, Carnegie Mellon University, Pittsburgh, USA, co-chair
JiÅ~YÃ WIEDERMANN, Academy of Science, Czech Republic
Damien WOODS, University College, Cork, Ireland
ORGANIZING COMMITTEE :
Klaus SUTNER, Carnegie Mellon University, Pittsburgh, USA, co-chair
Jerome DURAND-LOSE, Universite d'Orleans, Orleans, France, co-chair
Maurice MARGENSTERN, Universite Paul Verlaine - Metz, Metz,
France, co-chair
INVITED SPEAKERS :
Andrew ADAMATZKY, University of Bristol, UK
Olivier BOURNEZ, LORIA, INRIA-Lorraine, France
Mark BURGIN, University of Califonia at Los Angeles, USA
Jarkko KARI, University of Turku, Finland
Pascal KOIRAN, Ecole Normale Superieure de Lyon, France
Kenichi MORITA, University of Hiroshima, Japan
Kumbakonam Govindarajan SUBRAMANIAN, Christian College of
Chennai, India
Wilfried SIEG
Stephen WOLFRAM, Wolfram Research
MCU'95, MCU'98 and MCU'2001 gave rise to TCS special issues on "Machines,
Computations and Universality": 168-2 (1996), 231-2 (2000) and 296-2 (2002).
MCU'2004 and MCU'2007 gave rise to Fundamenta Informaticae special issues:
74(4) (2005), 91(1) and 91(2) (2008). The interest of computer scientists
for the topics of the conference increased in the last years. New domains
appeared, continuing them in a natural way. This explains why a regular
scientifing meeting on this topics must hold, each three years. And so,
three years after MCU'2007 the turn of MCU'2010 comes.
SUBMISSIONS
Send you submission by e-mail to one of the co-chairs of MCU (see
addresses at the end of the announcement) as a .ps or a .pdf file. NO OTHER
FORMAT will be accepted. Please, use the LaTeX style of Electronic
Proceedings in Theoretical Computer Science in order to produce your
submission. You can find the style file at:
http://style.eptcs.org/
Your submission should not exceed 25 pages in the above indicated format.
EXTENDED DATES:
Please, keep in mind the following dates are STRICT dead lines
in order to get proceedings ready for the conference:
Dead line for submission : April, 1, 2010
Notification of acceptance or rejection : June, 15, 2010
Dead line for receiving corrected version of accepted papers :
July, 8, 2010
CONFERENCE PROCEEDINGS
The proceedings of MCU'2010 will published by Electronic Proceedings in
Theoretical Computer Science, which already published the proceedings of CSP
2008, DCFS 2009, DCM 2009 (under ICALP 2009) and MeCBIC2009 and they will
publish those of DCFS 2010 for instance. The proceedings will be available
at the conference as a CD.
IJFCS SPECIAL ISSUE
A special issue of the International Journal of Foundations of Computer
Science devoted to "Universal Machines and Computations'VI" will be
published on the topics of the conference. A call for paper will be launched
just after MCU'2010 on the topics of the conference. The submitted papers
will be refereed and accepted papers after this process will be published in
the special issue. It will be possible to submit an extended version of a
paper published in the EPTCS proceedings of MCU'2010, provided that the
extension is actually needed or, preferably, that it contains new
substantial results. The selection process for the special issue will be
strict on these criteria.
REGISTRATION FEES :
In order to attend the conference, send your registration form by surface
mail at the below indicated address, by FAX, by e-mail or using the web
site of the conference when the date of registration will be announced.
Registration fees amount to 400 USD if paid before July 1st 2010 and to 450
USD after that date. Further details for the payment of the registration
fees will be available later on the web site of the conference.
LANGUAGE OF THE CONFERENCE
English.
RECEPTION
Reception of participants will hold on Monday, September, 20 and on
Tuesday, September, 21, at times which will be later indicated.
MAIL:
e-mails :
margens@univ-metz.fr
jerome.durand-lose@univ-orleans.fr
sutner@cs.cmu.edu
by surface mail :
Maurice MARGENSTERN
Universite Paul Verlaine - Metz,
LITA, EA 3097, UFR MIM,
Campus du Saulcy,
F - 57045 METZ CEDEX
FRANCE
Jerome Durand-Lose
Universite d'Orleans,
LIFO, Batiment IIIA,
Rue Leonard de Vinci
B.P. 6759
F - 45067 ORLEANS Cedex 2
FAX: +33387315309
WEB SITE:
http://www.cs.cmu.edu/~mcu2010/pages/other.html
===========================================================================
===========================================================================
6. (from Marian Gheorghe) 11th Conference on Membrane Computing, 24/8-27/8,
Jena, Germany:
+++++++++++++++++++++++++++++++
11th Conference on Membrane Computing, 24/8-27/8, Jena, Germany
http://cmc11.uni-jena.de
+++++++++++++++++++++++++++++++
ELEVENTH INTERNATIONAL CONFERENCE ON MEMBRANE COMPUTING, CMC11 - Jena,
Germany, August 24 (Tuesday) - 27 (Friday), 2010
The conference will continue the tradition of the previous 10 editions of
the Workshops on Membrane Computing, WMC1 (2000) ~V WMC10 (2009), and will
be
organized by
Friedrich Schiller University of Jena (http://www.uni-jena.de) and
Jena Centre for Bioinformatics (http://www.imb-jena.de/jcb)
The CMC11 website http://cmc11.uni-jena.de
Organizing committee:
Joern Behre
Gabi Escuela
Rudolf Freund - co-Chair
Thomas Hinze - Chair
Thorsten Lenser
Program committee:
Artiom Alhazov (Hiroshima, Japan)
Gabriel Ciobanu (Iasi, Romania)
Erzsebet Csuhaj-Varju (Budapest, Hungary)
Gabi Escuela (Jena, Germany)
Rudolf Freund (Vienna, Austria)
Pierluigi Frisco (Edinburgh, UK)
Marian Gheorghe (Sheffield, UK) ~V Chair
Thomas Hinze (Jena, Germany) ~V co-Chair
Oscar H. Ibarra (Santa Barbara, USA)
Vincenzo Manca (Verona, Italy)
Maurice Margenstern (Metz, France)
Giancarlo Mauri (Milan, Italy)
Van Nguyen (Adelaide, Australia)
Marion Oswald (Budapest, Hungary)
Linqiang Pan (Wuhan, China)
Gheorghe Paun (Bucharest, Romania and Sevilla, Spain)
Mario J. Perez-Jimenez (Sevilla, Spain)
Dario Pescini (Milan, Italy)
Francisco J. Romero-Campero (Nottingham, UK)
Monika Sturm (Dresden, Germany)
Sergey Verlan (Paris, France)
Submission deadline: Monday 10th May 2010
Three satellite workshops will be also organized in parallel to the
conference.
Applications of Membrane computing, Concurrency and Agent-based modelling
in POPulation biology (AMCA-POP)
Fourth Workshop on Membrane Computing and Biologically Inspired Process
Calculi (MeCBiC)
Workshop on Non-Classical Models of Automata and Applications (NCMA)
===========================================================================
===========================================================================
7. (from Chi Tat Chong) Asian Initiative for Infinity Graduate Summer School
in Logic: 28 June-23 July 2010, National University of Singapore:
Asian Initiative for Infinity (AII)
AII Graduate Summer School in Logic
28 June-23 July 2010
National University of Singapore
The AII Graduate Summer School is organized by the Institute for
Mathematical Sciences and the Department of Mathematics of the
National University of Singapore, with funding from the John
Templeton Foundation and the University. The Graduate Summer School
bridges the gap between a general graduate education in mathematical
logic and the specific preparation necessary to do research on
problems of current interest in the subject. In general, students who
attend the AII Summer School should have completed their first year,
and in some cases, may already be working on a thesis. While a
majority of the participants will be graduate students, some
postdoctoral scholars and researchers may also be interested in
attending.
Having completed at least one course in Mathematical Logic is
required, and completion of an additional graduate course in either
set theory or recursion theory is strongly recommended. Students
should be familiar with the Goedel Completeness and Incompleteness
Theorems and with the Goedel and Cohen Independence Theorems in Set
Theory.
The main activity of the AII Graduate Summer School will be a set of
three intensive short courses offered by leaders in the field,
designed to introduce students to exciting, current research topics.
These lectures will not duplicate standard courses available
elsewhere. Each course will consist of lectures with problem
sessions. On average, the participants of the AII Graduate Summer
School meet twice each day for lectures and then again for a problem
session.
Lectures will be conducted by Moti Gitik (Tel Aviv University),
Menachem Magidor (Hebrew University of Jerusalem), and Denis
Hirschfeldt (University of Chicago). In addition, Theodore A. Slaman
and W. Hugh Woodin of the University of California, Berkeley, as well
as two postdoctoral fellows supported by the John Templeton
Foundation, will be in residence during the period of the AII
Graduate Summer School.
Applications are invited from interested students. Each student
selected for participation will be provided with a stipend of at
least US$2000. Additional funding will be available to cover
accommodation. Applications will be considered from 7 April 2010 and
decisions made on a rolling basis, for as along as funds remain
available. For further details, visit
http://www2.ims.nus.edu.sg/Programs/010aiiss/index.php
Course Titles and Descriptions
Moti Gitik, Tel Aviv University
Title: Prikry-type forcings and short extenders forcings
We plan to cover the following topics: Basic Prikry forcing, tree
Prikry forcing, supercompact Prikry forcing, negation of the Singular
Cardinal Hypothesis via blowing up the power of a singular cardinal,
Extender Based Prikry forcing, forcings with short extenders-gap 2,
gap 3, arbitrary gap, dropping cofinalities, some further
directions.
Denis Hirschfeldt, The University of Chicago
Title: Reverse Mathematics of Combinatorial Principles
Computability theory and reverse mathematics provide tools to analyze
the relative strength of mathematical theorems. This analysis often
reveals surprising relationships between results in different areas,
such as the tight connection between nonstandard models of
arithmetic, the compactness of Cantor space, and results as seemingly
diverse as the existence of prime ideals of countable commutative
rings, Brouwer's fixed point theorem, the separable Hahn-Banach
Theorem, and Goedel's completeness theorem, among many others. It
also allows us to give mathematically precise versions of statements
such as "Adding hypothesis A makes Theorem B strictly weaker", or
"Technique X is essential to proving Theorem Y".
Combinatorial principles, such as versions of Ramsey's Theorem or
results about partial and linear orders, are a particularly rich
source of examples in computable mathematics and reverse
mathematics. This course will focus on fundamental techniques and
themes in this area, with the goal of preparing students to tackle
open problems, several of which will be discussed during the course.
Menachem Magidor, Hebrew University of Jerusalem
Title: The Theory of Possible Cofinalities (PCF) and some
applications
The theory of Possible Cofinalities is the theory developed by Shelah
which uncovers the deeper structure below cardinal arithmetic. The
main concept is (for a set of regular cardinals A) the set of
possible cofinalities of A (pcf(A)) which is the set of the regular
cardinals that can be realized as the cofinality of some ultraproduct
of A. It turned out that there are many deep results about this
operation (as well as fascinating problems).
The Theory has many applications. This course will develop the basic
concepts of the theory, will prove the main results like the bound on
and (time permitting) will give some other applications like the
existence of Jonson Algebras, the impossibility of certain cases of
Chang's Conjecture and more.
===========================================================================
===========================================================================
8. (from Barry Cooper) DCM 2010 workshop at FLOC'10: 2nd Call for Papers:
=========================================================================
Second Call for Papers
DCM 2010
6th International Workshop on Developments in Computational Models
** Causality, Computation, and Physics **
http://www.amsta.leeds.ac.uk/~pmt6sbc/DCM10/
Edinburgh, Scotland
9-10 July 2010
Deadline for extended abstracts: 01 April, 2010
A satellite event of FLoC - http://www.floc-conference.org/
=========================================================================
DCM 2010 is the sixth in a series of international workshops focusing on new
computational models. It aims to bring together researchers who are
currently developing new computational models or new features of a
traditional one. And to foster interaction, to provide a forum for
presenting new ideas and work in progress, and to enable newcomers to learn
about current activities in this area.
DCM 2010 will be a two-day satellite event of FLoC 2010, with a special
focus on the theme 'Causality, Computation, and Physics'. Day 2 of the
Workshop will have an emphasis on quantum computation and physics, held as
Quantum Information Science Scotland (QUISCO), and is co-sponsored by
Scottish Universities Physics Alliance (SUPA) and Scottish Informatics and
Computer Science Alliance (SICSA).
Topics of interest include all abstract models of computation and their
properties, and their applications to the development of programming
languages and systems:
- quantum computation, including implementations and formal methods in
quantum protocols;
- probabilistic computation and verification in modelling situations;
- chemical, biological and bio-inspired computation, including spatial
models, self-assembly, growth models;
- general concurrent models including the treatment of mobility, trust, and
security;
- information-theoretic ideas in computing.
PLEASE SUBMIT an extended abstract (of around 12 pages or less) in PDF
format to the conference EasyChair submission page:
https://www.easychair.org/login.cgi?conf=dcm2010
by the deadline:
01 April, 2010.
Accepted contributions will appear in a pre-proceedings special issue of the
EPTCS (Electronic Proceedings in Theoretical Computer Science).
After the workshop, full versions of selected papers will be invited for a
special issue of the internationally leading journal Mathematical Structures
in Computer Science (MSCS).
IMPORTANT DATES:
Submission deadline for extended abstracts: 01 April, 2010
Notification: 26 April
Workshop: 9-10 July, 2010
CONFIRMED INVITED SPEAKERS:
Cristian Calude (Auckland, New Zealand)
Russ Harmer (Paris/Harvard)
Gordon Plotkin (Edinburgh)
Vlatko Vedral (Oxford)
PROGRAMME COMMITTEE:
S Barry Cooper (Leeds, Co-chair) Prakash Panangaden (McGill, Co-chair) Elham
Kashefi (Edinburgh, Chair QUISCO 2010) Paola Bonizzoni (Milan) Olivier
Bournez (Paris) Vincent Danos (Edinburgh, CNRS) Mariangiola Dezani (Torino)
Andreas Doering (Oxford) Maribel FernC!ndez (London) Joseph Fitzsimons
(Oxford) Ivette Fuentes-Schuller (Nottingham) Simon Gay (Glasgow) Jean
Krivine (Paris) Ian Mackie (Ecole Polytechnique) Damian Markham (Paris)
Daniel Oi (Strathclyde) Simon Perdrix (Edinburgh and Paris) Susan Stepney
(York) John Tucker (Swansea)
Further information: Barry Cooper, pmt6sbc@leeds.ac.uk,
Prakash Panangaden prakash@cs.mcgill.ca
===========================================================================
===========================================================================
9. (from Ekaterina Komendantskaya) PAR'10 workshop at FLOC'10: 2nd Call for
Papers:
========================================================================
2nd Call for Papers
PAR 2010
Workshop on Partiality And Recursion in Interactive Theorem Provers
Edinburgh, UK, 15 July 2010
(satellite workshop of ITP'10)
a mid-FLoC 2010 workshop
>
========================================================================
Note the changes:
# Second invited speaker is now confirmed: Alexander Krauss, Munich
# Pre-proceedings will be published and maintained by EasyChair
# Change in the deadline for the final version (will affect only accepted
papers)
PAR'10 workshop is a venue for researchers working on new approaches to
cope with partial functions and terminating general (co)recursion in
theorem provers.
Theorem provers with inductive types provide a restricted programming
language together with a formal meta-theory for reasoning about the
language. When propositions are represented as types and proofs as
programs, non-terminating proofs are disallowed for consistency and
decidability of type checking. As a result, there is no trivial way to
represent partial functions, and termination is syntactically ensured by
imposing that the recursive calls must be made on structurally smaller
arguments. Similar issues exist for productivity of functions on
infinite objects where syntactic methods are used to ensure an infinite
flow of data. The workshop aims to address these issues and various
approaches for dealing with them.
We invite submissions on all aspects of partiality and termination of
general (co)recursive functions in a logical framework.
The topics of this workshop include but are not limited to:
* partial functions and functions over partial objects in theorem provers;
* specialised type systems for general (co)recursion;
* syntactical tests to guarantee termination of general recursive functions;
* syntactical tests to guarantee productivity of functions on infinite
objects;
* methods to ensure termination of special classes of recursion
definitions, eg nested recursion, simultaneous inductive-recursive data
types and functions;
* semantic approaches to termination and productivity, eg based on
domain theory and topology;
* categorical approaches to termination and productivity;
* algebra of programming with partial functions and general (co)recursion.
Description of software tools and case studies for dealing with the
issues in the scope of the workshop are welcome.
Submissions
-----------
The articles will be evaluated by the Program Committee for publication
in the proceedings of the workshop. In accordance with FLoC'10
requirements, PAR'10 proceedings will be published in an electronic
collection available online and maintained by EasyChair. The USB memory
sticks with accepted papers will be distributed during the workshop.
The post-proceedings of PAR'10 will be published after the workshop as
a special issue of EPTCS. Details on how and when to produce the
post-workshop version of the articles will be communicated after the
workshop to the authors of the accepted papers.
The articles must contain original contributions, be clearly written,
and include appropriate reference to and comparison with related work.
Submissions should preferably not exceed 16 pages (excluding
bibliography). Submissions must be prepared in LaTeX using the EasyChair
latex package( http://www.easychair.org/easychair.zip).
The web-based system EasyChair will be used for submission
().
Important dates
---------------
* 29 March 2010: Submission deadline
* 29 April 2010: Notification of acceptance
* 18 May 2010: Final version of accepted papers (Notice the slight
change compared to previous announcements)
* 15 July 2010: the workshop
Invited Speakers
----------------
* Conor McBride (University of Strathclyde)
* Alexander Krauss (Technical University of Munich)
Programme Committee
-------------------
Andreas Abel (Ludwig Maximilians University Munich, D)
Yves Bertot (INRIA Sophia-Antipolis, FR)
Ana Bove (Chalmers University of Technology, SE)
Ekaterina Komendantskaya (University of St Andrews, UK)
Ralph Matthes (IRIT Toulouse, FR)
Milad Niqui (CWI, NL)
Anton Setzer (Swansea University, UK)
Organisers
----------
Ana Bove
Ekaterina Komendantskaya
Milad Niqui
===========================================================================
===========================================================================
10. (from Barry Cooper) Funding opportunity - Foundational Questions:
Foundational Questions in the Mathematical Sciences
There is a grant opportunity in:
A) foundations of: mathematics, mathematical sciences, computer science;
B) artificial intelligence;
C) closely related fields.
The John Templeton Foundation accepts research proposals that directly or
indirectly address one of the following questions:
(1) What are the limits of mathematics in advancing human knowledge?
(2) What have the difficulties of AI taught us about the nature of mind and
intelligence?
Deadline for the initial inquiry is April 15, 2010. For more information,
please visit http://tiny.cc/mJuDR or http://www.templeton.org/
Please feel free to pass the information on to others who might be
interested in the grant opportunity.
===========================================================================
===========================================================================
11. (from Paul Andrews) EmergeNET4: Engineering Emergence:
EmergeNET4: Engineering Emergence
Call for registration
St William's College, York, UK
Mon 19 - Tues 20 April 2010
http://www.cs.york.ac.uk/nature/emergeNET4/
The EmergeNET network promotes interest in complex systems and emergence by
bringing together established researchers, those new to the area, and the
public. EmergeNET4 is the fourth workshop in the network series.
This two-day workshop at York will be a combination of two keynote speakers,
12 oral presentations, and discussion sessions to explore in depth the ideas
of Engineering Emergence.
EmergeNET4: Engineering Emergence, aims to provide a forum for discussing
all aspects of the engineering of emergence in complex systems. Complex
systems are characterised by low-level components that communicate and
interact with and within an environment, resulting in the emergence of
high-level system behaviours. Complex systems are often designed to help
understand emergence or to exploit emergent behaviours to help solve
problems in the real world. Emergent behaviours are by definition a function
of the system rather than any individual component, which makes the
engineering of these behaviours a non-trivial activity. Engineering of
emergence covers, amongst other aspects, abstract modelling (in diagrams or
mathematics), simulation in hardware or software, verification and
validation, and engineering tools, techniques and workflows.
KEYNOTE SPEAKERS:
Rene Doursat, Director of the Complex Systems Institute, Paris (ISC-PIF) and
researcher at the Centre National de la Recherche Scientifique (CNRS)
"Embryomorphic Engineering: From biological development to self-organized
computational architectures"
Russell J. Abbott, Department of Computer Science, California State
University, Los Angeles.
"From energy to information and back"
REGISTRATION
Registration is now open. Please see the "online store" at:
https://store.york.ac.uk/catalogue/products.asp?compid=1&deptid=114&catID=13
3&hasClicked=0
Registration covers attendance of both days of the workshop, including
lunches
and refreshments.
ACCOMMODATION
York has many hotels and guest houses with a wide range of prices:
http://www.visityork.org/. Please note that the meeting is being held in
central York (next to the Minster), NOT on the campus.
The Monkbar Hotel www.monkbarhotel.co.uk is a convenient and reasonably
priced
option.
STUDENT TRAVEL BURSARIES
We are offering a small number of travel bursaries of £100, for registered
students (when you register, you will be asked if you wish to apply for a
bursary). To apply, you should send the organisers
(emergenet-4@cs.york.ac.uk)
a short note explaining how attending the workshop will benefit your
studies,
accompanied by a letter from your supervisor recommending you for a bursary.
DEADLINE 10 April 2010, but note that bursary allocations will be decide on
a "first come first served" basis.
SPECIAL ISSUE OF NACO
There will later be an open call to submit a technical paper, that will be
peer reviewed, for a postproceedings special issue on "Engineering
Emergence" of the journal Natural Computing.
Find out more about EmergeNET4 at
http://www.cs.york.ac.uk/nature/emergeNET4/
Find out more about EmergeNET in general at www.emergenet.org
===========================================================================
===========================================================================
Items for the next CiE Newsletter should be sent in plain text to
s.b.cooper@leeds.ac.uk to arrive by March 28th, 2010
___________________________________________________________________________
ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk
CiE Conference Series http://www.illc.uva.nl/CiE
CiE 2010 http://www.cie2010.uac.pt/
CiE Membership Application Form http://www.cs.swan.ac.uk/acie
ALAN TURING YEAR http://www.turingcentenary.eu/
___________________________________________________________________________