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 opportunities Bulletin Item

Postdoctoral position in theoretical computer science ("Understanding the hardness of theorem proving"), Stockholm, SWEDEN


The Theory Group at KTH Royal Institute of Technology invites applications
for a postdoctoral position in Theoretical Computer Science.

KTH is the leading technical university in Sweden, with education and
research spanning from natural sciences to all branches of engineering
including architecture, industrial management and urban planning. The
Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a strong research
environment covering a wide range of research topics such as complexity
theory and approximation algorithms, computer and network security,
cryptography, formal methods and natural language processing. The group
has a consistent track record of publishing regularly in the leading
theoretical computer science conferences and journals worldwide, and the
research conducted here has attracted numerous international awards and
grants in recent years.

We are seeking a postdoctoral researcher in Theoretical Computer Science.
This position is funded by the research project "Understanding the
Hardness of Theorem Proving" in the area of proof complexity with
connections to SAT solving, and much of the activities of the research
group revolve around these themes. However, proof complexity has also
turned out to have deep, and sometimes surprising, connections to other
areas such as, e.g., circuit complexity, communication complexity, and
hardness of approximation, and therefore researchers in these or other
related areas are also of interest.

The project is led by Jakob Nordstrm (http://www.csc.kth.se/~jakobn) and
is financed by a Breakthrough Research Grant from the Swedish Research
Council and a Starting Independent Researcher Grant from the European
Research Council. A more detailed description of the project can be found
at http://www.csc.kth.se/~jakobn/project-proofcplx. The group currently
consists of one postdoctoral researcher and two PhD students (in addition
to the project leader).  Travel funding is included, and the group also
receives short-term and long-term visitors on a regular basis.

This is a full-time employed position for one year with a possible
one-year extension. The successful candidate is expected to start at the
latest in August-September 2013, although this is to some extent
negotiable.

The application deadline is May 5, 2013, but candidates are encouraged to
apply right away since applications are reviewed on a continuous basis.
More information and instructions how to apply can be found at
http://www.csc.kth.se/~jakobn/openings/D-2013-0315-Eng.php. Informal
enquiries are welcome and may be sent to Jakob Nordstrom.