This book constitutes the refereed proceedings of the 10th Conference on Computability in Europe, CiE 2014, held in Budapest, Hungary, in June 2014. The 42 revised papers presented were carefully reviewed and selected from 78 submissions and included together with 15 invited papers in this proceedings. The conference had six special sessions: computational linguistics, bio-inspired computation, history and philosophy of computing, computability theory, online algorithms and complexity in automata theory.

CiE 2008: Logic and Theory of Algorithms Athens, Greece, June 15-20, 2008 Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical devel- ment, and applications. Among the aims of the network is to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory, or relativity. Computations may be very general, depending on the foundations of set theory; or very speci?c, using the combinatorics of ?nite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, computational learning. Applications are everywhere, especially, in algebra, analysisand geometry, or data types and p- gramming. Within CiE there is general recognition of the underlying relevance of computability to physics and a broad range of other sciences, providing as it does a basic analysis of the causal structure of dynamical systems. Thisvolume, Logic andTheory of Algorithms, istheproceedingsofthefourth in a series of conferences of CiE that was held at the University of Athens, June 15-20, 2

This book constitutes the refereed proceedings of the Second International Conference on Computability in Europe, CiE 2006, held in Swansea, UK, June/July 2006. The book presents 31 revised full papers together with 30 invited papers, including papers corresponding to 8 plenary talks and 6 special sessions on proofs and computation, computable analysis, challenges in complexity, foundations of programming, mathematical models of computers and hypercomputers, and G del centenary: G del's legacy for computability.

This book constitutes the refereed proceedings of the 12th Conference on Computability in Europe, CiE 2016, held in Paris, France, in June/July 2016. The 18 revised full papers and 19 invited papers and invited extended abstracts were carefully reviewed and selected from 40 submissions. The conference CiE 2016 has six special sessions - two sessions, cryptography and information theory and symbolic dynamics, are organized for the first time in the conference series. In addition to this new developments in areas frequently covered in the CiE conference series were addressed in the following sessions: computable and constructive analysis; computation in biological systems; history and philosophy of computing; weak arithmetic.

This book constitutes the refereed proceedings of the 11th Conference on Computability in Europe, CiE 2015, held in Bucharest, Romania, in June/July 2015. The 26 revised papers presented were carefully reviewed and selected from 64 submissions and included together with 10 invited papers in this proceedings. The conference CiE 2015 has six special sessions: two sessions, Representing Streams and Reverse Mathematics, were introduced for the first time in the conference series. In addition to this, new developments in areas frequently covered in the CiE conference series were addressed in the further special sessions on Automata, Logic and Infinite Games; Bio-inspired Computation; Classical Computability Theory; as well as History and Philosophy of Computing.

The research programme Semantics and Syntax: a Legacy of Alan Turing, held at the Isaac Newton Institute for the Mathematical Sciences in Cambrudge UK 9 January - July 2012, was one of the central activities of the Alan Turing Year 2012, the world-wide celebration of the life and work of the exceptional scientist Alan Mathison Turing (1912-1954). It had almost 200 visiting fellows and programme participants, as well as several hundred additional workshop participants, and was organised by Arnold Beckmann (Swansea), S. Barry Cooper (Leeds), Benedikt Lowe (Amsterdam & Hamburg), Elvira Mayordomo (Zaragoza), and Nigel Smart (Bristol). This volume documents the presentations that were given as part of the programme, which include the abstracts of the teaser talks given in the Seminar at the Isaac Newton Institute, and abstracts of the talks given at five of the seven workshops, as well as written versions of two open problem sessions."