Universiteit van Amsterdam

Events

Institute for Logic, Language and Computation

Please note that this newsitem has been archived, and may contain outdated information or links.

27 June - 1 July 2016, Computability in Europe 2016 (CiE 2016), Paris, France

Date: 27 June - 1 July 2016
Location: Paris, France
Deadline: 23 April 2016

CiE 2016 is the twelfth conference organized by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world.

CiE 2016's Motto is: "Pursuit of the Universal". The year 2016 brings the eightieth anniversary of the publication of Alan Turing's seminal paper featuring the Universal Turing Machine. Just as the semantics of the machine gave rise to Incomputability, and pointed to future directions in proof theory, AI, generalised computability, the underlying role of typed information and natural language, and the computability and definability underpinning bioinformatics: so our conference subtitle honours Turing's role in anticipating the quest for universal computational frameworks across a wide spectrum of scientific and humanist disciplines.

For more information, see http://lipn.univ-paris13.fr/CIE2016/

The Programme Committee cordially invites all researchers (European and non-European) to submit their papers in all areas related to computability for presentation at the conference and inclusion in the proceedings. Papers that build bridges between different parts of the research community are particularly welcome. Submission deadline: 15 December 2015.

In addition to the formal presentations based on our LNCS proceedings volume, we invite researchers to present informal presentations. For this, please send us a brief description of your talk (between one paragraph and two pages) by the deadline April 23, 2016, via EasyChair, selecting the category "Informal Presentation".

Please note that this newsitem has been archived, and may contain outdated information or links.