ICO Alan Turing Lect...
 To celebrate the 100 year anniversary of the birth of the world renowned mathematician, code breaker, logician and computer scientist, the first ICO Alan Turing Lecture was held at the Museum of Science and Industry in Manchest...
Read More...
AISB Workshop: Senso...
Poster: http://aisb.org.uk/media/files/stw2012.pdf (media/files/stw2012.pdf) A day of discussion on the Sensorimotor account of Perception, Consciousness  and Robotics, its development and contemporary state. The first in a seri...
Read More...
Ms Pac-Man vs Ghosts...
This year's Ms Pac-man vs Ghosts Competition is now open for submissions. The competition allows you to develop AI controllers for the classical arcade game Ms Pac-Man. However, this year the competition takes a unique look at the...
Read More...
AISB YouTube Channel
The AISB has launched a YouTube channel:Â http://www.youtube.com/user/AISBTube (http://www.youtube.com/user/AISBTube). The channel currently holds a number of videos from the AISB 2010 Convention. Videos include the AISB round t...
Read More...
New AISB Website
Happy New Year! Welcome to the new AISB website. Over the coming weeks and months we will be making additional changes to the website, introducing some new content and so on. Please check back regularly to see what's new! During...
Read More...
AISB Website Beta
The AISB's new website is now gone beta. Some of the new features member's can look forward to enjoying will be better integration with the AISB LinkedIn group, frequent news updates, a new member's section and up-to-date AI med...
Read More...
AISB 2011 Convention
The AISB'11 Convention (http://www.aisb.org.uk/convention/aisb11/) was held from 4-7 April at York, organised by Dimitar Kazakov and George Tsoulas.
Read More...
Lighthill Debates
The Lighthill debates from 1973 are now available on YouTube. You need to a flashplayer enabled browser to view this YouTube video Â
Read More...
Alan Turing Year
2012 marks the centenary of Alan Turing's birth. Alan Turing Year (http://www.turingcentenary.eu/), seeks to bring together news of all the events and organisations which will be marking the occasion.
Read More...
Honouring Turing at ...
The AISB's own Convention in 2012 (convention/aisb12) will honour Turing  For 2012, AISB and IACAP (The International Association for Computing and Philosophy) have merged their annual symposia/conferences to form the AISB/IA...
Read More...
Notice
AISB opportunities Bulletin Item
Postdoctoral position in Theoretical Computer Science, Stockholm, SWEDEN
KTH Royal Institute of Technology
The Theory Group at KTH Royal Institute of Technology invites applications for a postdoctoral position in Theoretical Computer Science with a focus on proof complexity and connections to SAT solving. 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 postdoc for the research project "Understanding the Hardness of Theorem Proving" in the area of proof complexity with connections to SAT solving. This project aims to advance the frontiers of proof complexity, and to leverage this research to shed light on questions related to SAT solving. We are particularly interested in exploring the possibility of basing SAT solvers on stronger proof systems than are currently being used. In order to do so, however, a crucial step is to obtain a better understanding of the corresponding proof systems, and in this context there are a number of well-known and relatively longstanding open questions in proof complexity that we want to study and try to solve. A more detailed description of the project can be found at http://www.csc.kth.se/~jakobn/project-proofcplx. The project is led by Jakob Nordström (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. 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. To receive full consideration, applications should be received by January 14, 2013. More information and instructions how to apply can be found at http://www.csc.kth.se/~jakobn/openings/D-2012-0444-Eng.php. Informal enquiries are welcome and may be sent to Jakob Nordstrom. |



