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 ...


Erden in AI roundtab...

On Friday 4th September, philosopher and AISB member Dr Yasemin J Erden, participated in an AI roundtable at Second Home, hosted by Index Ventures and SwiftKey.   Joining her on the panel were colleagues from academia and indu...


AISB Convention 2016

The AISB Convention is an annual conference covering the range of AI and Cognitive Science, organised by the Society for the Study of Artificial Intelligence and Simulation of Behaviour. The 2016 Convention will be held at the Uni...


Bishop and AI news

Stephen Hawking thinks computers may surpass human intelligence and take over the world. This view is based on the ideology that all aspects of human mentality will eventually be realised by a program running on a suitable compu...


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...


Al-Rifaie on BBC

AISB Committee member and Research Fellow at Goldsmiths, University of London, Dr Mohammad Majid al-Rifaie was interviewed by the BBC (in Farsi) along with his colleague Mohammad Ali Javaheri Javid on the 6 November 2014. He was a...


AISB YouTube Channel

The AISB has launched a YouTube channel: ( The channel currently holds a number of videos from the AISB 2010 Convention. Videos include the AISB round t...



AISB event Bulletin Item

CALL FOR PAPERS: Theory and Applications of Models of Computation, 20-22 May 2013, Hong Kong, CHINA

TAMC 2013

The 10th Annual Conference on Theory and Application of Models of Computation 
(TAMC 2013 will be held in Hong Kong, China, 
from May 20 to May 22, 2013. TAMC aims at bringing together a wide range of 
researchers with interests in computational theory and applications.

The main themes of the conference are computability, complexity, and 
algorithms. Typical but not exclusive topics of interest include:

algebraic computation
algorithmic coding theory
algorithmic number theory
approximation algorithms
automata theory
circuit complexity
computational biology, and biological computing
computational complexity
computational game theory
computational logic
computational geometry
continuous and real computation
data structures
design and analysis of algorithms
distributed algorithms
fixed parameter tractability
graph algorithms
information and communication complexity
learning theory
natural computation
network algorithms, networks in nature and society
online algorithms
parallel algorithms
privacy and security
property testing
proof complexity
quantum computing
randomness, pseudo-randomness
randomized algorithms
streaming algorithms

Important Dates:
Submission deadline :        11:59 pm EST January 11, 2013

Program Chair:
Francis Chin (The University of Hong Kong)
Lap Chi Lau (The Chinese University of Hong Kong)
Luca Trevisan (Stanford University)

Program Committee:
Andrej Bogdanov (The Chinese University of Hong Kong)
Hubert Chan (University of Hong Kong)
Ho-Lin Chen (National Taiwan University)
Jianer Chen (Texas A&M University)
Ning Chen (Nanyang Technological University)
Wei Chen (Microsoft Research Asia)
Xi Chen (Columbia University)
Francis Chin (The University of Hong Kong, Chair)
Marek Chrobak (UC Riverside)
Nicola Galesi (Universit  di Roma La Sapienza)
Naveen Garg (IIT Dehli)
Navin Goyal (Microsoft Research India)
Nick Harvey (University of British Columbia)
Rahul Jain (National University of Singapore)
David Jao (University of Waterloo)
Ken-ichi Kawarabayashi (National Institute of Informatics, Japan)
Jochen Konemann (University of Waterloo)
Amit Kumar (IIT Delhi)
Lap Chi Lau (The Chinese University of Hong Kong, Co-chair)
Jian Li (Tsinghua University)
Rachel Lin (MIT and The Chinese University of Hong Kong)
Pinyan Lu (Microsoft Research Asia)
Mohammad Mahdian (Google Research)
Seffi Naor (Technion University)
Krzysztof Onak (IBM Research)
Periklis Papakonstantinou (Tsinghua University)
Seth Pettie (University of Michigan)
Atri Rudra (University at Buffalo, The State University of New York)
Alexander Russell (University of Connecticut)
Piotr Sankowski (University of Warsaw)
Rahul Santhanam (University of Edinburgh)
Anastasios Sidiropoulos (UIUC)
Mohit Singh (Microsoft Research Redmond)
Man Cho Anthony So (The Chinese University of Hong Kong)
John Steinberger (Tsinghua University)
Luca Trevisan (Stanford University, Co-chair)
Laszlo Vegh (London School of Economics)
David Woodruff (IBM Research)
Ke Yi (Hong Kong University of Science and Technology)
Qin Zhang (IBM Research and Indiana University)

Submission instructions: Authors should submit an extended abstract (not a 
full paper). The submission should contain a scholarly exposition of 
ideas, techniques, and results, including motivation and a clear 
comparison with related work. The length of the extended abstract should 
not exceed ten (10) letter-sized pages (not including bibliography and 
appendices.) Submitted papers must describe work not previously published. 
They must not be submitted simultaneously to another conference with 
refereed proceedings. Research that is already submitted to a journal may 
be submitted to TAMC13, provided that (a) the PC chair is notified in 
advance that this is the case, and (b) it is not scheduled for journal 
publication before the conference.

Proceedings: The TAMC proceedings will be published in the Lecture Notes 
in Computer Science Series by Springer ( 
Authors of accepted papers are expected to present their work at the 
conference. Special issues of the journals Theoretical Computer Science 
and Mathematical Structures in Computer Science devoted to a selected set 
of accepted papers of the conference are planned.