Contributed Papers

  • Russ Abbott
    The philosophy of computing archipelago (Informal Presentation)
  • Vladimir Aristov and Andrey Stroganov
    Development of a method of the computer analogy for investigating and solving complex nonlinear systems of differential equations (Informal Presentation)
  • Martijn Baartse and Klaus Meer
    Some results on interactive proofs for real computations (LNCS Paper)
  • Nikolay Bazhenov
    Prime Model with No Degree of Autostability Relative to Strong Constructivizations (LNCS Paper)
  • Edwin Beggs and John Tucker
    Analogue-digital systems with modes of operation (Informal Presentation)
  • Matteo Bianchetti
    A new kind of infinite time Turing machine (Informal Presentation)
  • Peter Bloem and Steven De Rooij
    Two Problems for Sophistication (Informal Presentation)
  • Guillaume Bonfante, Mohamed El-Aqqad, Benjamin Greenbaum and Mathieu Hoyrup
    Immune systems in computer virology (LNCS Paper)
  • Vasco Brattka, Matthew Hendtlass and Alexander P. Kreuzer
    On the uniform computational content of computability theory (Informal Presentation)
  • Matthew de Brecht, Matthias Schroeder and Victor Selivanov
    Base-Complexity Classifications of QCB0-Spaces (LNCS Extended Abstract)
  • Merlin Carl
    ITRM-Recognizability from Random Oracles (LNCS Paper)
  • Rodica Ceterchi, Kumbakonam Subramanian and Ibrahim Venkat
    P Systems with Parallel Rewriting for Chain Code Picture Languages (LNCS Paper)
  • Ahmet Cevik
    Recent degree theoretic developments in effectively closed sets (Informal Presentation)
  • Erzsébet Csuhaj-Varjú, Rudolf Freund and György Vaszil
    Watson-Crick L Systems Going Beyond Turing (Informal Presentation)
  • Mihai O. Dima
    IRIS Software-Development Platform (Informal Presentation)
  • Oznur Yasar Diner
    Approximation Algorithms For the File Transfer Scheduling Problem (Informal Presentation)
  • Thorsten Ehlers and Mike Müller
    New Bounds on Optimal Sorting Networks (LNCS Paper)
  • Joerg Endrullis, Clemens Grabmayer and Dimitri Hendriks
    Regularity Preserving but not Reflecting Encodings (Informal Presentation)
  • Christian Fermüller
    Connecting Lorenzen style games and Gentzen style calculi (Informal Presentation)
  • Henning Fernau, Florin Manea, Robert Mercas and Markus L. Schmid
    Pattern Matching with Variables: Fast Algorithms and New Hardness Results (Informal Presentation)
  • Michael Fiske
    Hiding a Key Transmission in Random Noise (Informal Presentation)
  • Johanna Franklin, Keng Meng Selwyn Ng and Reed Solomon
    Weak reducibilities and lowness for randomness (Informal Presentation)
  • Makoto Fujiwara
    Intuitionistic provability versus uniform provability in RCA (LNCS Paper)
  • Alex Galicki
    Randomness and Differentiability of Convex Functions (LNCS Paper)
  • David Gamez
    Are Computations Objectively Present in the Physical World? (Informal Presentation)
  • James Gay, S. Barry Cooper and Charles Harris
    Linear extensions of computable partial orders (Informal Presentation)
  • Vesa Halava, Tero Harju, Reino Niskanen and Igor Potapov
    Weighted automata on infinite words in the context of Attacker-Defender games (LNCS Paper)
  • Robin Havea
    A constructive look at the numerical range of a bounded operator on a Hilbert space (Informal Presentation)
  • Alberto Hernandez-Espinosa, Francisco Hernández-Quiroz and Héctor Zenil
    Natural Computing as a Basis for New Computationalism (Informal Presentation)
  • Santiago Hernández-Orozco, Hector Zenil and Francisco Hernández-Quiroz
    Measuring the Complexity of Emergent Structures in Environments of Variable Complexity (Informal Presentation)
  • Gregory Igusa and Julia Knight
    Computability strength of the field of real numbers (Informal Presentation)
  • Joost Joosten
    Turing jumps through provability (LNCS Paper)
  • Margarita Korovina and Oleg Kudinov
    Rice's Theorem in Effectively Enumerable Topological Spaces (LNCS Paper)
  • Michal Kovac
    Decidability of termination problems for sequential P systems with active membranes (LNCS Paper)
  • Lars Kristiansen and Robert Lubarsky
    Subrecursive Dedekind and Cauchy Reals (Informal Presentation)
  • Jürgen Landes and Jon Williamson
    Objective Bayesian nets from consistent datasets (Informal Presentation)
  • Iris Loeb and Ronald Meester
    How Constructive is Shafer's Constructive Probability? (Informal Presentation)
  • Eva Maia, Nelma Moreira and Rogério Reis
    Prefix and Right-Partial Derivative Automata (LNCS Paper)
  • Jeroen Van der Meeren and Andreas Weiermann
    How to compare Buchholz-style ordinal notation systems with Gordeev-style notation systems (LNCS Paper)
  • Florin Manea and Marius Dumitran
    Longest Gapped Repeats and Palindromes (Informal Presentation)
  • Timothy Mcnicholl
    A note on the computable categoricity of l^p spaces (LNCS Paper)
  • Georg Moser and Thomas Powell
    On the Computational Content of Termination Proofs (LNCS Paper)
  • David Nichols
    Computable Linear Models for Modal System S4.3.1 (Informal Presentation)
  • Andre Nies and Slawomir Solecki
    Local compactness for computable Polish metric spaces is $\Pi^1_1$-complete (LNCS Paper)
  • Amina Noor, Aitzaz Ahmad and Erchin Serpedin
    A Sparse Approach to Analyze Transcriptional Regulatory Networks with Incomplete Prior Information (Informal Presentation)
  • Ludovic Patey
    Iterative forcing and hyperimmunity in reverse mathematics (LNCS Paper)
  • Iosif Petrakis
    Completely regular Bishop spaces (LNCS Paper)
  • Stefan Popescu
    Accepting Networks of Polarized Evolutionary Picture Processors (Informal Presentation)
  • Stephane Le Roux and Arno Pauly
    Weihrauch degrees of finding equilibria in sequential games (LNCS Paper)
  • Jason Rute and Jan Reimann
    Randomness for ergodic measures (Informal Presentation)
  • Markus L. Schmid
    Computing Equality-Free String Factorisations (LNCS Paper)
  • Victor Selivanov
    Towards the Effective Descriptive Set Theory (LNCS Paper)
  • Alexandra Soskova, Alexander Terziivanov and Stefan Vatev
    Generalization of the notion of jump sequence of sets for sequences of structures (Informal Presentation)
  • Dan Constantin Spatarel
    Merging the Segment Tree and the Treap data structures into a single persistent, versatile data structure (Informal Presentation)
  • Shu Ming Sun, Ning Zhong and Martin Ziegler
    On the Computability of the Navier-Stokes Equation (LNCS Paper)
  • Mate Szabo
    Kálmar and Péter:Undecidability as a Consequence of Incompleteness (LNCS Paper)
  • David Toth
    Towards Embedding Theorem: Aut(D_{alpha e}) embeds into Aut(TOT_{alpha e}) (Informal Presentation)
  • Guohua Wu, Chengling Fang, Jiang Liu and Mars Yamaleev
    Nonexistence of Minimal Pairs in L[d] (LNCS Paper)

About

CiE 2015: Evolving Computability
Bucharest, Romania: 29 June to 3 July 2015

Organizers: Radu Gramatovici (Bucharest), Liviu Marin (Bucharest)
Programme Committee Chairs: Victor Mitrana (Bucharest), Mariya Soskova (Sofia)
Tutorial Speakers: John Reif (Duke Unversity), Steve Simpson (Pennsylvania State University)
Invited Speakers: Ann Copestake (University of Cambridge), Mircea Dumitru (University of Bucharest), Pawel Gawrychowski (University of Warsaw), Julia Knight (University of Notre Dame), Anca Muscholl (Université Bordeaux), Gheorghe Paun (Romanian Academy), Alexander Razborov (University of Chicago and Steklov Mathematical Institute), Vlatko Vedral (University of Oxford)

Conference Series

Computability in Europe

The conference series Computability in Europe started with CiE 2005. Since 2008 it is the conference series of the Association Computability in Europe.
The series is coordinated by the CiE Conference Series Steering Committee:

Arnold Beckmann (Swansea, chair, 2005-2017)
Laurent Bienvenu (Paris, 2012-2016)
Alessandra Carbone (Paris, 2014-2018)
Barry Cooper (Leeds, president of the Association CiE)
Natasha Jonoska (Tampa FL, 2011-2015)
Benedikt Löwe (Amsterdam, 2005-2017)
Florin Manea (Kiel, 2013-2017)
Dag Normann (Oslo, treasurer of the Association CiE)
Mariya Soskova (Sofia, 2012-2016)
Susan Stepney (York, 2013-2017)

Contact

CiE 2015 is organised by the Faculty of Mathemics and Computer Science of the University of Bucharest.

University of Bucharest Faculty of Mathematics and Computer Science

Phone: +40213142863
Fax: +40213156990
Address: 14 Academiei St., RO-010014, Bucuresti, Romania
E-mail: cie2015@fmi.unibuc.ro

Sponsors

For the list of sponsors, visit this page.