CiE Newsletter No. 2, December 2008 ___________________________________________________________________________ CONTENTS: 1. Announcement of THE SCIENCE AND PHILOSOPHY OF UNCONVENTIONAL COMPUTING (SPUC09) Cambridge (UK), March 23-25, 2009 2. Chair in Computational Biology, at Heriot-Watt University 3. ACKERMANN AWARD 2009 - CALL FOR NOMINATIONS 4. New (3rd) edition of Li-Vitanyi: An Introduction to Kolmogorov Complexity and Its Applications 5. DNA15: The Fifteenth International Meeting on DNA Computing and Molecular Programming 6. Call for Papers - Eleventh Asian Logic Conference 7. CfP for APAL special issue - Advances in Constructive Topology and Logical Foundations in honor of the 60th birthday of Giovanni Sambin 8. New: HANDBOOK OF QUANTUM LOGIC AND QUANTUM STRUCTURES ___________________________________________________________________________ 1. (from Mark Hogarth) THE SCIENCE AND PHILOSOPHY OF UNCONVENTIONAL COMPUTING (SPUC09) Cambridge (UK), March 23-25, 2009 THE SCIENCE AND PHILOSOPHY OF UNCONVENTIONAL COMPUTING (SPUC09) Cambridge (UK), March 23-25, 2009 First call for papers We welcome submissions on topics normally classified under 'natural computing' or 'unconventional computing' or 'hypercomputing', including (but not restricted to) quantum computing, relativistic computing, biology-based computing, analogue computing, and also submissions on the philosophical implications of these new fields for topics, including (but again not restricted to) philosophy of mind, philosophy of mathematics, the Church-Turing thesis. Each presentation should last no more than 30 minutes; a further 10 minutes will be allowed for discussion. Those wishing to make a presentation should submit by email a 250-word abstract of their paper to Mark Hogarth (mhogarth@cantab.net); enquiries to the same. Registration fee (yet to be fixed) will be around ukp100. Student bursaries are available. Conference website: http://web.mac.com/mhogarth/Site/SPUC_Conference.html ORGANISER Mark Hogarth (Cambridge, UK) CONFIRMED INVITED SPEAKERS INCLUDE Selmer Brinsjord (New York, USA)) Jeff Barrett (Irvine, USA) Philip Welch (Bristol, UK) Tim Button (Harvard, USA) Cristian Calude (Auckland, New Zealand) Istvan Nemeti (Budapest, Hungry) Benjamin Wells (San Francisco, USA) Hajnal Andreka (Budapest, Hungry) Apostolos Syropoulos (Xanthi, Greece) Susan Stepney (York, UK) Bruce MacLennan (Tennessee, USA) Peter Kugel (Boston, USA) Mark Sprevak (Cambridge, UK) ADVISORY PANEL Mike Stannett (Sheffield) John Tucker (Swansea) Barry Cooper (Leeds) Jose Felix Costa (Swansea) Sponsored by EPSRC through HyperNet (the Hypercomputation Research Network, EP/E064183/1) _______________________________ Dr M Hogarth Leverhulme Research Fellow in Philosophy Girton College Cambridge CB3 0JG T: 01223 338911 mhogarth@cantab.net http://web.mac.com/mhogarth/ ___________________________________________________________________________ 2. (from Pierluigi Frisco) Chair in Computational Biology, at Heriot-Watt University ---------------- Chair in Computational Biology - Ref 169/08/W The Life and Physical Sciences Interface Theme at Heriot-Watt University wishes to appoint a Professor of Computational Biology. The post is based in the School of Mathematical and Computer Sciences (MACS) and a major element of the role is to build multidisciplinary interactions with other groups in the university with excellent research in the Life Sciences and Interfaces. Applicants should have a track record in a mathematical, statistical or computational aspect of biology. Applicants are welcome from outstanding applicants at all career stages and an appointment may be made at any level up to Chair. For recruitment to senior levels, an outstanding track record of winning research funding as a principal investigator is required. Ref: 169/08/W Closing date: 31 January 2009 For Full application details and further information please visit http://stg.barkersdigital.co.uk/HWU/FOF/html/vacancies.htm ------------------------ Please notice that even if the post is in Computational Biology the person will work in the Department of Computer Science. ___________________________________________________________________________ 3. (from Carlos Areces) ACKERMANN AWARD 2009 - CALL FOR NOMINATIONS ACKERMANN AWARD 2009 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS * Eligible for the 2009 Ackermann Award are PhD dissertations in topics specified by the EACSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1.1.2007 and 31.12. 2008. * The deadline for submission is 15.3.2009. * Submission details are available at www.dimi.uniud.it/eacsl/award.html www.cs.technion.ac.il/eacsl * The award consists of - a diploma, - an invitation to present the thesis at the CSL conference, - the publication of the abstract of the thesis and the laudation in the CSL proceedings, - travel support to attend the conference. * The 2009 Ackermann Award will be presented to the recipients at the annual conference of the EACSL (CSL'09). * The jury consists of nine members: - The president of EACSL, J. Makowsky (Haifa); - The borad-member of EACSL, A. Dawar (Cambridge); - One member of the LICS organizing committee, G. Plotkin (Edinburgh); - P.-L. Curien (Paris) - A. Durand (Paris) - J. van Benthem (Amsterdam) - M. Grohe (Berlin); - M. Hyland (Cambridge); - A. Razborov (Moscow and Princeton). * The jury is entitled to give more than one award per year. * The previous Ackermann Award recipients were: 2005: Mikolaj Bojanczyk, Konstantin Korovin, Nathan Segerlind; 2006: Stefan Milius and Balder ten Cate; 2007: Dietmar Berwanger, Stephane Lengrand and Ting Zhang. 2008: Krishnendu Chatterjee * For the three years 2007-2009, the Award is sponsored by Logitech, S.A., Romanel, Switzerland, the worlds leading provider of personal peripherals. --------------------------------------------------------------------------- 4. (from Paul Vitanyi) New (3rd) edition of Li-Vitanyi: An Introduction to Kolmogorov Complexity and Its Applications An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science) (Hardcover) by Ming Li and Paul M.B. Vitanyi Product Details (from Amazon) * Hardcover: 792 pages * Publisher: Springer; 3 edition (November 5, 2008) * Language: English * ISBN-10: 0387339981 * ISBN-13: 978-0387339986 * Product Dimensions: 9.3 x 7.3 x 1.6 inches * Shipping Weight: 3.2 pounds (View shipping rates and policies) * Average Customer Review: 7 Reviews 5 star: 100% (7) 4 star: (0) 3 star: (0) 2 star: (0) 1 star: (0) Blurb on the back cover: This bestseller is considered the standard reference on Kolmogorov complexity, a modern type of information theory concerned with the information in individual objects. New key features and topics in the 3rd edition: * New results on randomness. * Kolmogorov's structure function, model selection, and MDL. * Incompressibility method: counting unlabeled graphs, Shellsort, communication complexity. * Derandomization. * Kolmogorov complexity versus Shannon information, rate-distortion, lossy compression, denoising. * Theoretical results on information distance. * The similarity metric with applications to genomics, phylogeny, clustering, classification, semantic meaning, question-answer systems. *Quantum Kolmogorov complexity. ``Li and Vitanyi have provided an ideal book for the exploration of a deep, beautiful and important part of the computer science.'' -- Juris Hartmanis, Turing Award Winner 1993, Cornell University, Ithaka, NY. ``The book is likely to remain the standard treatment of Kolmogorov complexity for a long time.'' -- Jorma J. Rissanen, IBM Research, California. ``The book of Li and Vitanyi is unexcelled.'' -- Ray J. Solomonoff, Oxbridge Research, Cambridge, Massachusetts "The book is outstanding...the authors did their job unbelievably well...necessary reading for all kinds of readers from undergraduate students to top authorities in the field." -- Vladimir A. Uspensky and Alexander K. Shen, Journal of Symbolic Logic [Review] ``Careful and clear introduction to a subtle and deep field'' --David G. Stork, Ricoh Innovations, California, Amazon [Review] ``THE book on Kolmogorov Complexity'' --Lance Fortnow, University of Chicago, Chicago, Ill., Amazon [Review] Written by two experts in the field, this book is ideal for advanced undergraduate students, graduate students, and researchers in all fields of science. It is self-contained: it contains the basic requirements from mathematics, probability theory, statistics, information theory and computer science. Included are history, theory, new developments, a wide range of applications, numerous (new) problem sets, comments, source references, and hints to solutions of problems. This is the only comprehensive treatment of the central ideas of Kolmogorov complexity and their applications. --------------------------------------------------------------------------- 5. (from Alessandra Carbone) CfP for DNA15: The Fifteenth International Meeting on DNA Computing and Molecular Programming CALL FOR PAPERS --------------------------------------------------------------------- DNA15: The Fifteenth International Meeting on DNA Computing and Molecular Programming Fayetteville, Arkansas, USA, June 8-12, 2009 http://dna15.uark.edu --------------------------------------------------------------------- THE MEETING Biomolecular computing is an interdisciplinary field that draws together Chemistry, Computer Science, Mathematics, Molecular Biology, and Physics for the molecular-scale manipulation of matter. The International Meeting on DNA Computing and Molecular Programming is a forum where scientists with different backgrounds, yet sharing a common interest in biomolecular computing, meet and present their latest results. Continuing this tradition, the 15th International Meeting on DNA computing and Molecular Programming, under the auspices of the International Society for Nanoscale Science, Computation and Engineering (ISNSCE), will focus on the current experimental and theoretical results with the greatest impact. SOLICITATION FOR PAPERS Papers and poster presentations are sought in all areas that relate to biomolecular computing, including (but not restricted to): demonstrations of biomolecular computing (using DNA and/or other molecules), theoretical models of biomolecular computing, biomolecular algorithms, computational processes in vitro and in vivo, analysis and theoretical models of laboratory techniques, biotechnological and other applications of DNA computing, DNA nanostructures, DNA devices such as DNA motors, DNA error evaluation and correction, in vitro evolution, molecular design, self-assembled systems, nucleic acid chemistry, and simulation tools. Papers and posters with new experimental results are particularly encouraged. Please refer to the conference website, http://dna15.uark.edu for more details, and instructions for authors. INSTRUCTIONS FOR AUTHORS Electronic Submissions: All papers and abstracts should be submitted electronically by March 2, 2009. For submission please follow the instructions and the link at the conference web page, http://dna15.uark.edu. Papers must be submitted in pdf format. The use of LaTeX is strongly encouraged. The users of Word may download a conversion tool such as cutePDF to produce a PDF file for submission. Submissions should be done through http://www.easychair.org/conferences/?conf=dna15. TRACKS Authors may choose between two submission tracks. Papers considered for oral presentation will automatically be considered for poster presentation if they are not accepted for oral presentation. Track A (Traditional) - Full Paper: Submissions of full papers will be considered for inclusion in the conference proceedings and should conform to the following guidelines: - The total length of the paper should not exceed 10 pages (11 point type, single spaced, with 1 inch margins). - Each paper should contain an abstract which briefly describes the primary results and their importance. - After the conference, selected papers will be included in a volume of the Springer-Verlag Lecture Notes in Computer Science. Please follow the formatting instructions at:http: //www.springer.com/computer/lncs/. Track B - One-Page Abstract: Primarily for authors submitting experimental results who plan to submit to a journal rather than publish in the conference proceedings. Submissions should conform to the following guidelines: - The total length of the abstract should not exceed 1 page (11 point type, single spaced, with 1 inch margins). - The one-page abstract should describe the primary results and their importance. - Authors who wish to have their Track B submission considered for an oral presentation should include a manuscript, a thesis chapter or some other form of supporting documentation; the purpose of this document is to enable the program committee to evaluate the merit of the work for oral presentation. Only the one-page abstract will appear in the proceedings. Track B papers unaccompanied by adequate documentation will not be eligible for oral presentation. STUDENT PAPER PRIZES The best two papers with a student as the lead and presenting author will be awarded travel prizes. Eligible papers should be noted in the submission and accompanied by a brief letter of support from the research adviser. Recipients of the prize will be notified at the time of acceptance. Some other student scholarships may also be available. --------------------------------------------------------------------- IMPORTANT DATES --------------------------------------------------------------------- Submission deadline: March 2, 2009 Notification of acceptance: April 20, 2009 Revised manuscripts due: May 4, 2009 Conference: June 8-12, 2009 Accommodation Deadline: May 1, 2009 --------------------------------------------------------------------- INVITED SPEAKERS (confirmed) James Aspnes, Computer Science, Yale University Reinhard Laubenbacher, Virginia Bioinformatics Institute, Virginia Tech David Leigh, Chemistry, University of Edinburgh Kenichi Morita, Information Engineering, Hiroshima University Michael Roukes, Physics, Cal Tech Itamar Willner, Chemistry, The Hebrew University of Jerusalem SPONSORS * National Science Foundation (NSF) * Arkansas Science and Technology Authority (ASTA) * University of Arkansas College of Engineering * University of Arkansas Graduate School * University of Arkansas College of Agricultural, Food, and Life Sciences * University of Arkansas Department of Computer Science and Computer Engineering * University of Arkansas Department of Biological Engineering RELATED EVENTS - Tutorial Day: June 8, 2009 - tutorials covering important topics related to biomolecular computing. WEBSITE AND CONTACTS http://dna15.uark.edu Natasha Jonoska (International Steering Committee Chair) Russell Deaton and Akira Suyama (Program Committee Co-Chairs) Russell Deaton and Jin-Woo Kim (Organizing Committee Co-Chairs) --------------------------------------------------------------------------- 6. (from Peter Schuster and Yue Yang) Call for Papers - Eleventh Asian Logic Conference ---------------------------------------------------------------------------- Eleventh Asian Logic Conference National University of Singapore Singapore 22 - 27 June 2009 Deadline for submissions: 15 March 2009 http://www.ims.nus.edu.sg/Programs/09asianlogic/index.htm#Visitors ---------------------------------------------------------------------------- The Eleventh Asian Logic Conference will be held in Singapore from 22 to 27 June 2009. The Asian Logic Conference series is sponsored by the Association for Symbolic Logic, and the meetings are major international events in mathematical logic. The series features the latest scientific developments in the fields in mathematical logic and its applications, logic in computer science, and philosophical logic. It also aims to promote mathematical logic in the Asia-Pacific region and to bring logicians together both from within Asia and elsewhere to exchange information and ideas. > From 1981 to 2008, the Asian Logic Conference has been held triennially and rotated among countries in the Asia-Pacific region. The previous meetings took place in Singapore (1981), Bangkok (1984), Beijing (1987), Tokyo (1990), Singapore (1993), Beijing (1996), Hsi-Tou (1999), Chongqing (2002), Novosibirsk (2005), and Kobe (2008). In 2008, the East Asian and Australasian Committees of the Association of Symbolic Logic decided to shorten the three-year cycle to two. The committees also chose Singapore 2009 to begin the new cycle in honor of Professor Chitat Chong's 60th birthday. Professor Chong is one of the founders of the Asian Logic Conference series and a central figure in establishing mathematical logic in Asia. The ALC2009 program will cover a wide range of topics and will feature plenary lectures presented by leading specialists in every major area of mathematical logic. The conference topics include, but not limited to: Computability/recursion theory Constructive mathematics Model theory and its applications Non-classical logic Philosophy of science and logic Proof theory Reverse mathematics Set theory Theoretical computer science The confirmed invited speakers are: Klaus Ambos-Spies (University of Heidelberg, Germany), Toshiyasu Arai (Kobe University, Japan), Bektur Baizhanov (Institute of Informatics and Control Problems, Kazakhstan), John T. Baldwin (University of Illinois at Chicago, USA), Rodney Downey (Victoria University of Wellington, New Zealand), Ilijas Farah (York University, Canada), Renling Jin (College of Charleston, USA), Iskander Sh. Kalimullin (Kazan State University, Russia), Peter Koellner (Harvard University, USA), Manuel Lerman (University of Connecticut, USA), Menachem Magidor (Hebrew University of Jerusalem, Israel), Michael Rathjen (University of Leeds, U.K.), Gerald E. Sacks (Harvard University, USA), Stephen G. Simpson (Pennsylvania State University, USA), Theodore A. Slaman (University of California at Berkeley, USA), Frank Stephan (National University of Singapore, Singapore), W. Hugh Woodin (University of California at Berkeley, USA). We particularly invite papers by logicians from the Asia-Pacific region. We also strongly encourage graduate students to attend the conference. Limited student support will be available. Those who are interested should write to alc2009@nus.edu.sg with a supporting letter from a supervisor before 15 March 2009. Abstracts of contributed talks must contain: title and authors; physical and e-mail addresses; identification of corresponding author, if not the first author; a short abstract; and a list of keywords. They should be written in ENGLISH. They should be submitted as email attachments BOTH as a LaTeX file AND as a pdf file to alc2009@nus.edu.sg by the deadline of 15 March 2009. We will acknowledge receipt of your submission and notify you about your paper's acceptance/rejection by 31 March 2009. Abstracts of contributed talks submitted by ASL members will be published in The Bulletin of Symbolic Logic. --------------------------------------------------------------------------- 7. (from Peter Schuster) CfP for APAL special issue - Advances in Constructive Topology and Logical Foundations in honor of the 60th birthday of Giovanni Sambin Call for Papers: Advances in Constructive Topology and Logical Foundations in honor of the 60th birthday of Giovanni Sambin ------------------------------------------------------------------------- Special Issue of Annals of Pure and Applied Logic ------------------------------------------------------------------------- The Workshop "Advances in Constructive Topology and Logical Foundations" in honor of the 60th birthday of Giovanni Sambin was held in Padua on October 8-11 2008: see http://www.math.unipd.it/60thsambin/ The proceedings of this workshop will be published as a special issue of the Annals of Pure and Applied Logic with the following guest editors: Maria Emilia Maietti, Erik Palmgren and Michael Rathjen These proceedings are open for high-level research papers about constructive topology and related logical foundations. We will appreciate very much if you let us know your intention of submitting a paper by sending an email to apalsambin60@math.unipd.it before April 30, 2009 ------------------------------------------------------------- Deadline for submissions: June 30, 2009 Submissions by email to: apalsambin60@math.unipd.it --------------------------------------------------------------------------- 8. (from Bart D'Hooghe) New: HANDBOOK OF QUANTUM LOGIC AND QUANTUM STRUCTURES HANDBOOK OF QUANTUM LOGIC AND QUANTUM STRUCTURES Quantum Logic Edited By Kurt Engesser, Kings College London, London, UK Dov M. Gabbay, King's College London, UK Daniel Lehmann, Hebrew University of Jerusalem, Israel Contents Foreword -Dvurecenski Editorial Preface -Engesser-Gabbay-Lehmann 1.) The Birkhoff-von Neumann Concept of Quantum Logic -Redei 2.) Quantum Logic a Logic -Pavicic-MegillIs 3.) Is Logic Empirical -Bacciagaluppi 4.) Quantum Axiomatics -Aerts 5.) Quantum Logic and Nonclassical Logics -Cattaneo-Dalla Chiara-Giuntini-Paoli 6.) Soler's Theorem -Prestel 7.) Operational Quantum Logic: A Survey and Analysis -Moore-Valckenborgh 8.) Test Spaces -Wilce 9.) Lehmann Nonmonotonicity and Holicity in Quantum Logic -Engesser-Gabbay- 10.) Methods in Quantum Logic -NishimuraGentzen 11.) Extending Classical Logic for Reasoning about Quantum Systems - Chadha-Mateus-Sernadas-Sernadas 12.) Quantum Logic and Categorical Logic -Abramsky-Coecke 13.) Quantum Logic and Linear Logic -Abramsky-Coecke 14.) Contexts in Quantum, Classical and Partition Logics -Svozil 15.) A Quantum Logic of Down Below -Bruza-Widdows-Woods 16.) A Completeness Theorem of Quantum Set Theory -Titani Bibliographic details Hardbound, 726 pages, publication date: NOV-2008 ISBN-13: 978-0-444-52869-8 ISBN-10: 0-444-52869-5 Imprint: ELSEVIER Price and Ordering Price: GBP 130 USD 225 EUR 185 Books and book related electronic products are priced in US dollars (USD), euro (EUR), and Great Britain Pounds (GBP). For more details, see http://www.elsevier.com/wps/find/bookdescription.cws_home/716651/description #description --------------------------------------------------------------------------- Items for the next CiE Newsletter should be sent to pmt6sbc@leeds.ac.uk to arrive by December 31, 2008 ---------------------------------------------------------------------------