CiE Newsletter No.42, December 13, 2010: Please send any items you would like included in next letter to Olivier Bournez DEADLINE: January 10th 2011. ___________________________________________________________________________ ** COMPUTABILITY IN EUROPE 2011 "Models of Computation in Context", Sofia, Bulgaria, 27 June - 2 July: For the latest news on CiE 2011 in Sofia, go to: http://cie2011.fmi.uni-sofia.bg/ The CiE 2011 submission deadline is January 14, 2011 ___________________________________________________________________________ CONTENTS: 1) 15th International Conference on Developments in Language Theory DLT 2011. 2) Fifth International Symposium on Quantum Interaction QI'2010 3) Second International Workshop on Developments in Implicit Computational complExity DICE 2011. 4) 14th Congress of Logic, Methodology and Philosophy of Science -- DEADLINE EXTENSION 5) Special issue IJFCS: Frontier between Decidability and Undecidability and Related Problems 6) Next Workshop in Computability Theory 7) SPECIAL EVENT - LSV/Cachan - Petr Jancar on Pushdown Automata / Jerome Leroux on Vector Addition Systems - Jan. 20th 2011 8) 75 Years of Quantum EntanglementFoundations and Information Theoretic Applications 9) HYPERNET (Hypercomputation Workshop) 2011 10) PHYSICS & COMPUTATION 2011 11) Special Issue of Applied Mathematics and Computation as post-proceedings of Physics and Computation 2010 12) Quantum foundations announcements list; welcome! (fwd) ___________________________________________________________________________ 1) (from Giancarlo Mauri) DLT 2011: 15th International Conference on Developments in Language Theory *********************************************************************** First Call for Papers 15th International Conference on Developments in Language Theory July 19 - 22, 2011 Università degli Studi di Milano - Bicocca Milano, Italy *********************************************************************** Authors are invited to submit papers presenting original research results on formal languages, automata theory, and related areas. Typical research areas of the conference include but are not limited to: * Grammars, acceptors and transducers for words, trees and graphs; * Algebraic theories of automata; codes; symbolic dynamics; * Algorithmic, combinatorial and algebraic properties of words and languages; * Decidability questions; * Applications of language theory, including: natural computing, image manipulation and compression, text algorithms, cryptography, concurrency, complexity theory and logic; * Cellular automata and multidimensional patterns; * Language theory aspects of quantum computing and bio-computing Papers should not exceed 12 pages and should be formatted according to the usual LNCS article style. Proofs omitted due to space constraints can be put into an appendix to be read by the program committee members at their discretion. Submissions deviating from these guidelines risk rejection. Papers must be submitted electronically through the web page: http://www.easychair.org/conferences/?conf=dlt2011 Important Dates: Deadline for submissions: February 21, 2011 Notification to authors: April 2, 2011 Final version: April 18, 2011 Conference: July 19 - 22, 2011 Accepted papers will be published in the proceedings of the conference (Lecture Notes in Computer Science, Springer-Verlag). Selected contributions will be invited for a special issue of the International Journal of Foundations of Computer Science. Simultaneous submission to other conferences with published proceedings is not allowed. Invited Speakers: Antonio Restivo (Palermo) Maxime Crochemore (Marne-la-Vallée) Thomas Wilke (Kiel) Arseny Shur (Yekaterinburg) Sheng Yu (London, Ontario) Program Committee: Alberto Bertoni (Milano) Christian Choffrut (Paris) Stefano Crespi Reghizzi (Milano) Aldo de Luca (Napoli) Manfred Droste (Leipzig) Zoltán Ésik (Szeged) Paul Gastin (Cachan) Hendrik Jan Hoogeboom (Leiden) Marcus Holzer (Giessen) Oscar H. Ibarra (Santa Barbara) Lila Kari (London, Ontario) Natasha Jonoska (Tampa) Giancarlo Mauri (Milano, chair) Anca Muscholl (Bordeaux) Alexander Okhotin (Turku) Michel Rigo (Liège) Wojciech Rytter (Warsaw) Mikhail V. Volkov (Yekaterinburg) Hsu-Chun Yen (Taiwan) Takashi Yokomori (Tokyo) Organizing Committee: Paola Bonizzoni (Milano) Paolo Cazzaniga (Milano) Claudio Ferretti (Milano) Alberto Leporati (Milano, chair) Dario Pescini (Milano) Antonio E. Porreca (Milano) Claudio Zandron (Milano) Further information can be found at http://dlt2011.disco.unimib.it/ Contact information: Email: dlt2011@disco.unimib.it ___________________________________________________________________________ 2) Fifth International Symposium on Quantum Interaction QI'2010 ---------------------------------------------------------- CALL FOR PAPERS -------------------------- The Fifth International Symposium on Quantum Interaction (QI'2010, http://www.rgu.ac.uk/qi2011), 27-29 June 2010, Aberdeen, United Kingdom. Quantum Interaction (QI) is an emerging field which is applying quantum theory (QT) to domains such as artificial intelligence, human language, cognition, information retrieval, biology, political science, economics, organisations and social interaction. After highly successful previous meetings (QI'2007 at Stanford, QI'2008 at Oxford, QI'2009 at Saarbruecken, QI'2010 at Washington DC), the Fifth International Quantum Interaction Symposium will take place in Aberdeen, UK from 27 to 29 June 2011. This symposium will bring together researchers interested in how QT addresses problems in non-quantum domains. QI'2011 will also include a half day tutorial session on 26 June 2011, with a number of leading researchers delivering tutorial on the foundations of QT, the application of QT to human cognition and decision making, and QT inspired semantic information processing. ***Call for Papers*** We are seeking submission of high-quality and original research papers that have not been previously published and are not under review for another conference or journal. Papers should address one or more of the following broad content areas, but not limited to: - Artificial Intelligence (Logic, planning, agents and multi-agent systems); - Biological or Complex Systems; - Cognition and Brain (memory, cognitive processes, neural networks, consciousness); - Decision Theory (political, psychological, cultural, organisational, social sciences); - Finance and Economics (decision-making, mergers, corporate cultures); - Information Processing and Retrieval; - Language and Linguistics; The post-conference proceedings of QI'2011 will be published by Springer 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*** 28th March 2011: Abstract submission deadline; 1st April 2011: Paper submission deadline; 1st May 2011: Notification of acceptance; 1st June 2011: Camera-Ready Copy; 26th June 2011: Tutorial Session; 27th - 29th June 2011: Conference; ***Submission*** Authors are invited to submit research papers up to 12 pages. All submissions should be prepared in English using the LNCS template, which can be downloaded from http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0. Please submit online at: http://www.easychair.org/conferences/?conf=qi2011 ***Organization*** Steering Committee: Peter Bruza (Queensland University of Technology, Australia) William Lawless (Paine College, USA) Keith van Rijsbergen (University of Glasgow, UK) Donald Sofge (Naval Research Laboratory, USA) Dominic Widdows (Google, USA) General Chair: Dawei Song (Robert Gordon University, UK) Programme Committee Chair: Massimo Melucci (University of Padua, Italy) Publicity Chair: Sachi Arafat (University of Glasgow, UK) Proceedings Chair: Ingo Frommholz (University of Glasgow, UK) Local Organization co-Chairs: Jun Wang and Peng Zhang (Robert Gordon University, UK) ___________________________________________________________________________ 3) DICE 2011: Second International Workshop on Developments in Implicit Computational complExity ------------------------------------------------------------------------------ ------- Call for papers --------- ---------------------------------------------------------------------------------- Second International Workshop on Developments in Implicit Computational complExity (DICE 2011) http://dice11.loria.fr/ April, 2nd-3rd, Saarbrücken, Germany as part of ETAPS 2011 ----------------------------------------------------------------------------------- SCOPE AND TOPIC: 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) The first DICE workshop ( http://www.ens-lyon.fr/LIP/DICE2010/) was held in 2010 at ETAPS. Before that, several meetings on this topic had already been held with success in Paris in 2008 (WICC'08, http://www-lipn.univ-paris13.fr/~mogbil/wicc08/ ), in Marseille in 2006 (GEOCAL'06 workshop on Implicit computational complexity, http://www-lipn.univ-paris13.fr/~baillot/GEOCAL06/ICCworkshop.html) , and Paris in 2004 (ICC and logic meeting, http://www-lipn.univ-paris13.fr/~baillot/workshopGEOCAL/complexite.html). INVITED SPEAKERS: * Martin Hofmann * Daniel Leivant * Ricardo Peña IMPORTANT DATES: * Paper submission: December 15th, 2010 * Notification date: January 27th, 2011 * Final version due: February 8th, 2011 * Workshop: April 2nd-3rd, 2011 SUBMISSION PROCEDURE: There will be two categories of submissions: * Full papers: up to 15 pages (including bibliography). * Extended abstracts for short presentations (that will not be included in the proceedings): up to 3 pages; Authors must indicate if their submission belongs to the second category (by mentioning "(Extended Abstract)" in the title). Papers must be sumbitted electronically, as pdf files, at the following URL: http://www.easychair.org/conferences/?conf=dice2010 Submissions of the first category (full papers) should not have been published before or submitted simultaneously to another conference or journal. This restriction does not hold for the second category (extended abstracts). These latter submissions will be an opportunity to present work in progress or to get a feedback from the audience on a work already published elsewhere. Submissions of papers authored by PC members are allowed. We plan to publish post-proceedings. PROGRAMME COMMITTEE: Amir Ben-Amram (Academic College of Tel-Aviv) Patrick Baillot (ENS Lyon, CNRS) Jean-Yves Marion (Université de Lorraine) (Chair) Simone Martini (Università di Bologna) Damiano Mazza (Université Paris 13) Georg Moser (Universität Innsbruck) Ricardo Peña (Universidad de Madrid) Luca Roversi (Università di Torino) Jim Royer (Syracuse University) STEERING COMMITTEE: Patrick Baillot (ENS Lyon, CNRS) (Chair) Martin Hofmann (Ludwig-Maximilians-Universität München) Jean-Yves Marion (Université de Lorraine) Simona Ronchi Della Rocca (Università di Torino) FINANCIAL SUPPORT: The workshop is partially supported by: ANR project COMPLICE (Implicit Computational Complexity, Concurrency and Extraction), ANR-08-BLANC-0211-01. CONTACT: Jean-Yves.Marion@loria.fr ___________________________________________________________________________ 4) 14th Congress of Logic, Methodology and Philosophy of Science FINAL CALL FOR PAPERS -- DEADLINE EXTENSION 14th Congress of Logic, Methodology and Philosophy of Science Nancy, France, 19-26 July, 2011 Website: http://www.clmps2011.org/ The deadline for contributions (individual papers, symposia proposals and affiliated meetings) has been extended by one month. The deadline for submissions is now 31 January 2011. The remaining schedule is unchanged. 31 January 2011: Submission deadline (extended) 31 March 2011: Notification of acceptance 30 April 2011: Early registration deadline To register and submit, please see: http://www.clmps2011.org/en/registration.html For further information about the program, financial support for participants and practical matters, please visit the Congress website. Peter Schroeder-Heister (Chair General Programme Committee) Gerhard Heinzmann (Chair Organizing Committee) ___________________________________________________________________________ 5) (from Jerome Durand-Lose) Special issue IJFCS: Frontier between Decidability and Undecidability and Related Problems ================================== Special issue IJFCS: Frontier between Decidability and Undecidability and Related Problems CALL FOR PAPERS Special issue of INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE on Frontier between Decidability and Undecidability and Related Problems Computability is one of the fundamental domains of computer science. Many questions remain open in this area and their solution is of great importance both for the advance of knowledge and for possible applications. Many problems of real life in their present mathematical or theoretical modeling are undecidable. Most often, this means a lack of information. If enough information can be supplied, the problem may become decidable and then, the question arises of the complexity of solving algorithms. How much information has to be supplied? This is an important question and we are at the beginning of an era where partial answers can be approached if not completely given. This is the main motivation of the topic {\bf Frontier between decidability and undecidability}. At the present moment, the syntactic aspects of the limitation of information are considered. In this regard, substantial progress has been obtained recently, for instance, in the number of states and or symbols needed to construct a universal Turing machine. Important results about the same question and similar criteria have also been obtained in other models of discrete computations such as register machine, cellular automata and other abstract devices, some of them being connected with biology. The same question can be attacked from a very different point of view starting from the old approach of analog computations. Recent progress was achieved in this trend which is vividly developing. Other trends also try to obtain super-Turing computations which also constitute another look at the same question. Accordingly, the special issue is planned to focus on the state-of-the art solutions about the frontier between decidability and undecidability and related problems. Topics of interest include but are not limited to: Digital Computations: Turing machines, register machines, cellular automata, other automata, tiling of the plane, polyominoes, snakes, neural networks, molecular computations, word processing (groups and monoids), molecular computing and other machines Analog and Hybrid Computations: BSS machines, infinite 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 automata, tilings, neural nets, Post systems, P 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 Please, submit an electronic version of your submission as a .ps or .pdf file to be sent electronically to one of the guest editors by December 31, 2010: J\'er\^ome Durand-Lose Maurice Margenstern Klaus Sutner jerome.durand-lose@univ-orleans.fr margens@univ-metz.fr sutner@cs.cmu.edu Université d'Orléans, LIFO Université Carnegie Mellon Paul-Verlaine - Metz, University, LITA Department of Computer Science Schedule: Deadline for submission: December, 31, 2010 Notification of acceptance or rejection: May, 1st, 2011 Deadline for receiving corrected version for revised versions: July 1st, 2011 Final decision for revised papers: October 1st, 2011 Instructions for submissions: Your submission should be prepared by using the LaTeX style file of the International Journal of Foundations of Computer Science to be found at: http://www.cs.ucsb.edu/~ijfcs/ and should not exceed 20 pages in this format, including figures, tables and possible appendices. Your submission should not have been previously published, nor currently submitted elsewhere for publication. All submitted papers will be refereed in accordance with the usual criteria of IJFCS. ___________________________________________________________________________ 6) Workshop in Computability Theory The next installment of the Workshop in Computability Theory series will be held at the University of San Francisco in San Francisco on March 22--23, 2010, immediately preceding the 2011 ASL North American Annual Meeting to be held at the University of California - Berkeley on March 24--27, 2010. Information about the meeting site and schedule will be available at http://www.usfca.edu/artsci/math/wct/, and speakers will include * Wesley Calvert * Doug Cenzer * Barry Cooper * Noam Greenberg * Bjørn Kjos-Hanssen * Julia Knight * Ted Slaman * Reed Solomon * Alexandra Soskova * Rebecca Steiner We look forward to seeing you there! Jennifer Chubb & Sara Quinn ___________________________________________________________________________ 7) SPECIAL EVENT - LSV/Cachan - Petr Jancar on Pushdown Automata / Jerome Leroux on Vector Addition Systems - Jan. 20th 2011 Pushdown Automata and Vector Addition Systems: A New Look At Two Classical Problems January 20, 2011 - LSV - Cachan http://www.lsv.ens-cachan.fr/Events/Pavas/ This special event focuses on two recent major claims/results: - a new proof, by Petr Jancar, for the decidability of equivalence for deterministic pushdown automata, first established by G. Senizergues, and - a new proof, by Jerome Leroux, for the decidability of accessibility in vector addition systems, or equivalently in Petri nets, first established by E. W. Mayr (and S. R. Kosaraju). Our aim here is to provide an exceptional opportunity for Jancar and Leroux to provide an in-depth presentation of their proofs in front of a large audience of expert specialists as well as younger researchers interested in the field. This will be a unique occasion for the kind of interaction and attention to details that is only possible in a 3-hour tutorial format. PROGRAMME 09:30 - 10:00 Welcome & Coffee 10:00 - 13:00 Petr Jancar: Decidability and complexity of DPDA Language Equivalence via 1st Order Grammars 13:00 - 14:30 Lunch 14:30 - 17:30 Jerome Leroux: Vector Addition System Reachability Problem (A Short Self-Contained Proof) 17:30 Closing 20:00 Banquet REGISTRATION Participation to the events is free but registration is required (deadline for registration: Jan. 7th). Please use our electronic registration procedure at http://www.lsv.ens-cachan.fr/Events/Pavas. A confirmation by e-mail will be sent. LOCATION The workshop will take place in the Amphitheatre Marie Curie, in the Batiment d'Alembert of the Ecole normale superieure de Cachan. Travel instructions available at http://www.lsv.ens-cachan.fr/Events/Pavas/ CONTACT This event is organized by Ph. Schnoebelen and L. Doyen. See http://www.lsv.ens-cachan.fr/Events/Pavas for up-to-date information. ABSTRACTS OF THE TUTORIALS Petr Jancar (Techn. Univ. Ostrava, CZ) ====================================== Decidability and complexity of DPDA Language Equivalence via 1st Order Grammars The aim of the talk is to present a complete proof of the decidability of language equivalence for deterministic pushdown automata, which is the famous problem solved by G. Senizergues, for which C. Stirling derived a primitive recursive complexity upper bound. The planned presentation is novel, based on a reduction to trace equivalence of deterministic first order grammars; this can be viewed as a problem in term rewriting systems. The presentation is intended to illuminate all crucial ideas, avoiding technicalities when possible; an ideal form of the talk supposes an interactive cooperation with the audience. After all ideas are understood and the decidability is established, the above mentioned complexity result can be easily explained. We can also discuss a smooth generalization of the decidability result to bisimulation equivalence for general (nondeterministic) first order grammars; this is more-or-less equivalent to the decidability result for nondeterministic pushdown automata with restricted use of epsilon-steps, for which the first proof was also given by G. Senizergues. The talk is based on a written version which has been made public at http://arxiv.org/abs/1010.4760 Jerome Leroux (Labri, CNRS & Univ. Bordeaux, FR) ================================================ Vector Addition System Reachability Problem (A Short Self-Contained Proof) The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition (KLMTS decomposition). Recently from this decomposition, we deduced that a final configuration is not reachable from an initial one if and only if there exists a Presburger inductive invariant that contains the initial configuration but not the final one. Since we can decide if a Preburger formula denotes an inductive invariant, we deduce from this result that there exist checkable certificates of non-reachability in the Presburger arithmetic. In particular, there exists a simple algorithm for deciding the general VAS reachability problem based on two semi-algorithms. A first one that tries to prove the reachability by enumerating finite sequences of actions and a second one that tries to prove the non-reachability by enumerating Presburger formulas. In this presentation we provide the first proof of the VAS reachability problem that is not based on the KLMST decomposition. The proof is based on the notion of production relations inspired from Hauschildt that directly provides the existence of Presburger inductive invariants. The talk is based on a written version which has been made public at http://hal.archives-ouvertes.fr/hal-00502865/fr/ ___________________________________________________________________________ 8) 75 Years of Quantum EntanglementFoundations and Information Theoretic Applications A conference on 75 years of quantum entanglement will be organized in Kolkata http://bose.res.in/~quantum2011/75Years.html Topics *Applications of Quantum Entanglement in Cryptography and Teleportation *Cluster states, multipartite entanglement and its quantification *Contexuality and Nonlocality *Continuous variable entanglement *Entanglement sudden death, rebirth and dynamical control *Entanglement witnesses *Entanglement and our universe: black holes and cosmology *Experimental efforts towards Quantum Computations *Foundational aspects of Quantum Entanglement *Indistinguishability, configuration space non-commutativity and entanglement *Macroscopic quantum entanglement and the classical limit *Quantum measurements through standard and non-standard approaches *Quantum optical implementations of information transfer *Time of arrival, quantum trajectories, wave packet dynamics and novel quantum phenomena ___________________________________________________________________________ 9) HYPERNET (Hypercomputation Workshop) 2011 Call for Papers / Posters HYPERNET (Hypercomputation Workshop) 2011 Co-located Workshop with Unconventional Computation 2011 June 6-10, Turku, Finland UC2011 Main Site: http://www.math.utu.fi/projects/uc2011/ Papers and posters are solicited on all aspects of Hypercomputation. KEY DATES Paper submission deadline: 28 Feb 2011 Paper authors notified: 1 Apr 2011 Final versions due: 18 Apr 2011 Poster submission deadline: 18 Apr 2011 Poster authors notified: 25 Apr 2011 Early registration ends: 2 May 2011 PUBLICATION Accepted papers will be published in the first instance in electronic form as a Workshop pre-proceedings. As in previous years, authors will be invited, following the Workshop, to submit finalised versions of their work for journal publication. Submissions should be submitted electronically via EasyChair, in PDF format: http://www.easychair.org/conferences/?conf=hypernet11 Papers should initially be no more than 12 sides in length (excluding bibliography), and should be formatted for A4 paper. TOPICS INCLUDE (but are not restricted to) * analogue systems * arithmetic hierarchy * axiomatizations of physics * Church-Turing thesis * complexity of nonstandard systems * computing beyond the Turing barrier * digital physics * economics and uncomputability * nonstandard computation * philosophical aspects * quantum computation * relativistic computation * transfinite systems * unconventional computation and its properties * wormhole computation PROGRAMME COMMITTEE Selim Akl (Queen's) Hajnal AndrÈka (Budapest) Olivier Bournez (Ecole Polytechnique) Cristian Calude (Auckland) Barry Cooper (Leeds) Francisco AntÙnio DÛria (Rio de Janeiro) Marian Gheorghe (Sheffield) Viv Kendon (Leeds) Peter Kugel (Boston) Kenichi Morita (Hiroshima) Istvan NÈmeti (Budapest) Ion Petre (Turku) Mike Stannett (Sheffield) Susan Stepney (York) Gergely SzÈkely (Budapest) Christof Teuscher (Portland) John Tucker (Swansea) Benjamin Wells (San Francisco) ORGANISING COMMITTEE Hajnal AndrÈka (Budapest) Cristian Calude (Auckland) Ion Petre (Turku) Mike Stannett (Sheffield) Susan Stepney (York) COORDINATOR / QUERIES Mike Stannett (m.stannett@dcs.shef.ac.uk) ___________________________________________________________________________ 10) PHYSICS & COMPUTATION 2011 Call for Papers / Posters PHYSICS & COMPUTATION 2011 Co-located Workshop with Unconventional Computation 2011 June 6-10, Turku, Finland UC2011 Main Site: http://www.math.utu.fi/projects/uc2011/ Papers and posters are solicited on the relationships between Physics and Computation. KEY DATES Paper submission deadline: 28 Feb 2011 Paper authors notified: 1 Apr 2011 Final versions due: 18 Apr 2011 Poster submission deadline: 18 Apr 2011 Poster authors notified: 25 Apr 2011 Early registration ends: 2 May 2011 PUBLICATION Accepted papers will be published in the first instance in electronic form as a Workshop pre-proceedings. As in previous years, authors will be invited, following the Workshop, to submit finalised versions of their work for journal publication. Submissions should be submitted electronically via EasyChair, in PDF format: http://www.easychair.org/conferences/?conf=pc2011 Papers should initially be no more than 12 sides in length (excluding bibliography), and should be formatted for A4 paper. TOPICS INCLUDE (but are not restricted to) * analogue computation * axiomatization of physics: completeness, decidability, reduction * digital physics * optical computation * philosophy of physics and computation * quantum computation (digital, analogue) and its applications (biology, mathematics, etc.) * quantum logics * quantum randomness * reaction-diffusion models of computation: including brain dynamics, BZ computers * relativity: spacetimes, computation, time travel, speedup * theory of measurement: axiomatization, complexity * wormhole computation PROGRAMME COMMITTEE Andy Adamatzky (Bristol) Alastair Abbott (Auckland) Hajnal AndrÈka (Budapest) Olivier Bournez (Ecole Polytechnique) Ad·n Cabello (Seville) Cristian Calude (Auckland) Shlomi Dolev (Ben Gurion) Elham Kashefi (Edinburgh) Viv Kendon (Leeds) Giuseppe Longo (Paris) Kenichi Morita (Hiroshima) Ferdinand Peper (NiCT) Ion Petre (Turku) Mike Stannett (Sheffield) Susan Stepney (York) Damien Woods (CalTech) Paolo Zuliani (Carnegie Mellon) ORGANISING COMMITTEE Hajnal AndrÈka (Budapest) Cristian Calude (Auckland) Ion Petre (Turku) Mike Stannett (Sheffield) Susan Stepney (York) COORDINATOR / QUERIES Mike Stannett (m.stannett@dcs.shef.ac.uk) ___________________________________________________________________________ 11) Special Issue of Applied Mathematics and Computation as post-proceedings of Physics and Computation 2010 Dear colleague, We are now starting the edition of a Special Issue of Applied Mathematics and Computation (Elsevier, impact factor 1.236) as post-proceedings of the Third International Workshop on Physics and Computation (P&C 2010), held in Egypt last September (http://www.pc2010.uac.pt/index.html). Post-proceedings of P&C 2010 are being processed for Natural Computing (http://www.springer.com/computer/theoretical+computer+science/journal/11047), International Journal of Unconventional Computing (http://www.oldcitypublishing.com/IJUC/IJUC.html, and Applied Mathematics and Computation (AMC)(http://www.elsevier.com/wps/find/journaldescription.cws_home/522482/description#description). AMC Special Issue on P&C welcome papers on the subjects listed in http://www.pc2010.uac.pt/contents/call_for_papers.html, submitted until February 15, 2011. The issue welcome papers accepted for presentation, papers produced by the invited speakers, papers authored by the PC members, as well as papers from other (non-participating) authors working on the field. The papers should be submitted through the EES System of Elsevier http://ees.elsevier.com/amc/ under the category «Physics and Computation», and will be refereed according with AMC policy. Best regards, -- +++++++++++++++++++++++++++++++++++++++++++++++ José Félix Costa Department of Mathematics Instituto Superior Técnico Av. Rovisco Pais 1049-001 Lisboa PORTUGAL e-mail: felixgomescosta@gmail.com www: http://fgc.math.ist.utl.pt/jfc.htm +++++++++++++++++++++++++++++++++++++++++++++++ ___________________________________________________________________________ 12) Quantum foundations announcements list; welcome! (fwd) Subject: [quantum-foundations] This is the quantum foundations announcements list; welcome! Welcome to the quantum foundations announcement list! Please forward this email to other relevant local lists, post on blogs, or advertise by any other means that would reach potential subscribers. It was agreed by many that the existence of a quantum foundations mailing list, with a wide scope and involving the broad international community, was long overdue. This moderated list (to avoid spam or abuse) will mainly distribute announcements of conferences and other international events in the area, as well as other relevant adverts such as jobs in the area. It is set up at Oxford University, which should provide a guarantee of stability and sustainability. The scope ranges from the mathematical end of quantum foundations research to the purely philosophical issues. (UN)SUBSCRIBING INSTRUCTIONS: To subscribe to the list, send a blank email to quantum-foundations-subscribe@maillist.ox.ac.uk To unsubscribe from the list, send a blank email to quantum-foundations-unsubscribe@maillist.ox.ac.uk POSTING INSTRUCTIONS: To make a post, send an email to quantum-foundations@maillist.ox.ac.uk You may also want to put this address in your 'safe list' so that messages don't get sent to your spam folder. Any complaints etc can be send to: Bob Coecke Jamie Vicary