AISB convention 2017

  In the run up to AISB2017 convention, I've asked Joanna Bryson, from the organising team, to answer few questions about the convention and what comes with it. Mohammad Majid al-Rifaie (https://twitter.com/mohmaj) Tu...


Read More...

Harold Cohen

Harold Cohen, tireless computer art pioneer dies at 87   Harold Cohen at the Tate (1983) Aaron image in background   Harold Cohen died at 87 in his studio on 27th April 2016 in Encintias California, USA.The first time I hear...


Read More...

Dancing with Pixies?...

At TEDx Tottenham, London Mark Bishop (the former chair of the Society) demonstrates that if the ongoing EU flagship science project - the 1.6 billion dollar "Human Brain Project” - ultimately succeeds in understanding all as...


Read More...

Computerised Minds. ...

A video sponsored by the society discusses Searle's Chinese Room Argument (CRA) and the heated debates surrounding it. In this video, which is accessible to the general public and those with interest in AI, Olly's Philosophy Tube ...


Read More...

Connection Science

All individual members of The Society for the Study of Artificial Intelligence and Simulation of Behaviour have a personal subscription to the Taylor Francis journal Connection Science as part of their membership. How to Acce...


Read More...
01234

Notice

AISB event Bulletin Item

CALL FOR PAPERS: Machines, Computations and Universality, Sep 9-12, 2013.University of Zurich, SWITZERLAND

http://mcu2013.ini.uzh.ch/


SCOPE

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


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


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

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

4. universality and undecidability in continuous models of computation.


IMPORTANT DATES

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


PROGRAM COMMITTEE

Andrew Adamatzky        (University of the West of England, UK)
Matthew Cook            (University of Zurich and ETH Zurich) (co-chair)
Erzsbet Csuhaj-Varj   (Etvs Lornd University, Budapest, Hungary)
Jrme Durand-Lose      (University of Orlans, France)
Rudolf Freund           (University of Vienna, Austria)
Gabriel Istrate         (Institute e-Austria, Timisoara, Romania)
Jarkko Kari             (University of Turku, Finland)
Lila Kari               (University of Western Ontario, London, Canada)
Kamala Krithivasan      (Indian Institute of Technology, Chennai, India)
Maurice Margenstern     (University of Lorraine, France)
Turlough Neary          (University of Zurich and ETH Zurich) (co-chair)
Matthew Pattitz         (University of Arkansas, Fayetteville, USA)
Igor Potapov            (University of Liverpool, UK)
Klaus Sutner            (Carnegie Mellon University, Pittsburgh, USA)
Sergey Verlan           (University of Paris Est, France)
Damien Woods            (California Institute of Technology, USA)


INVITED SPEAKERS

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


PAPER PREPARATION AND SUBMISSION

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


CONFERENCE PROCEEDINGS

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

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