Computability in Europe

Association CiE logo‎

Computability in Europe (CiE) is an international organization of mathematicians, logicians, computer scientists, philosophers, theoretical physicists and others interested in new developments in computability and in their underlying significance for the real world. CiE originated as a research network in 2003, and the Association Computability in Europe was formed in July 2008.

Its first and current president is Professor S. Barry Cooper, a mathematician from Leeds.

CiE is also a major international conference series. The first CiE conference was held in Amsterdam in June, 2005, subsequent meetings being in Swansea, Wales (CiE 2006), Siena, Italy (CiE 2007), Athens (CiE 2008), and Heidelberg, Germany (CiE 2009). CiE 2010 will be in Ponta Delgada (Azores), Portugal and CiE 2011 in Sofia, Bulgaria. CiE 2012 in Cambridge, England will be part of the Alan Turing Year.

CiE aims to widen understanding and appreciation of the importance of the concepts and techniques of computability theory, and to support the development of a vibrant multi-disciplinary community of researchers focused on computability-related topics. CiE positions itself at the interface between applied and fundamental research, prioritising mathematical approaches to computational barriers.

CiE has editorial responsibility for the Springer book series Theory and Applications of Computability.

External links

• Association Computability in Europe website
• CiE conference series website
• CiE 2012 website
• Alan Turing Year website

This article about a scientific organization is a stub. You can help Wikipedia by expanding it.v · Categories: Theoretical computer science Mathematics organizations Mathematical logic organizations International nongovernmental organizations Science and technology in Europe Computer science organizations Learned societies Mathematics stubs Computer science stubs Scientific organization stubs Wikimedia Foundation. 2010. Игры ⚽ Поможем решить контрольную работу Computability Computable Document Format Look at other dictionaries: Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown …   Wikipedia Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… …   Wikipedia Alan Turing — Turing redirects here. For other uses, see Turing (disambiguation). Alan Turing Turing at the time of his election to Fellowship of the Royal Society …   Wikipedia S. Barry Cooper — (born 1943) is a British mathematician and computability theorist. He is currently Professor of Mathematical Logic at the University of Leeds. His book Computability Theory (Chapman Hall/CRC) has made this basic but technical research area… …   Wikipedia Busy beaver — In computability theory, a busy beaver (from the colloquial expression for an industrious person) is a Turing machine that attains the maximum operational busyness (such as measured by the number of steps performed, or the number of nonblank… …   Wikipedia Pancomputationalism — (Pan computationalism, Naturalist computationalism) is a view that the universe is a huge computational machine or rather a network of computational processes which following fundamental physical laws compute (dynamically develop) its own next… …   Wikipedia Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… …   Wikipedia Hypercomputation — refers to various hypothetical methods for the computation of non Turing computable functions (see also supertask). The term was first introduced in 1999 by Jack Copeland and Diane Proudfoot [Copeland and Proudfoot,… …   Wikipedia Theoretical computer science — is the collection of topics of computer science that focuses on the more abstract, logical and mathematical aspects of computing, such as the theory of computation, analysis of algorithms, and semantics of programming languages. Although not… …   Wikipedia Interval-valued computation — is a special kind of theoretical models for computation. It is capable of working on “interval valued bytes”: special subsets of the unit interval. If such computers were realized, their computation power would be much greater than that of… …   Wikipedia 18+ © Academic, 2000-2024 Contact us: Technical Support, Advertising Dictionaries export, created on PHP, Joomla, Drupal, WordPress, MODx. Mark and share Search through all dictionaries Translate… Search Internet Share the article and excerpts Direct link … Do a right-click on the link above and select “Copy Link”