**LNCS:** **The paper has been accepted for presentation at CiE 2014 and it has been selected for publication in the Springer LNCS volume. ****PRESENTATION: The paper has been accepted for presentation at CiE 2014 and it will be included in the informal electronic proceedings of CiE 2014.**

**Antonis Achilleos. Modal Logics with Hard Diamond-free Fragments **(PRESENTATION)

**Pieter Adriaans. The Modeling Chasm: Counting Turing Machines using Occam's razor **(PRESENTATION)

**Artiom Alhazov, Bogdan Aman, Rudolf Freund and Gheorghe Păun. P Systems with Matter and Anti-Matter **(PRESENTATION)

**Rachel Armstrong. A multi-disciplinary exploration of ‘embodied’ forms of natural computing and architectural design practice **(PRESENTATION)

**Péter Battyányi and György Vaszil. Membrane systems and the chemical computing paradigm **(PRESENTATION)

**Cristina Bazgan, Morgan Chopin, André Nichterlein and Florian Sikora. Parameterized Inapproximability of Target Set Selection and Generalizations **(LNCS)

**Stefano Beretta and Riccardo Dondi. Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability **(LNCS)

**Ulrich Berger and Tie Hou. Uniform Schemata for Proof Rules **(LNCS)

**Claus Brillowski. Elements of Self-Hosting Languages **(PRESENTATION)

**Sabine Broda, António Machiavelo, Nelma Moreira and Rogério Reis. On the Equivalence of Automata for KAT-expressions **(LNCS)

** Linda Brown Westrick. Effective Dimension in Subshifts (**PRESENTATION

**Jérémie Cabessa and Alessadro Villa. On Interactively Computable Functions **(PRESENTATION)

**Mingzhong Cai, Hristo Ganchev, Steffen Lempp, Joseph S. Miller and Mariya Soskova. Kalimullin pairs and definability in the enumeration degrees **(PRESENTATION)

**Merlin Carl. Algorithmic Randomness for Infinite Time Register Machines **(LNCS)

**Douglas Cenzer and Francis Adams. Computability and Categoricity of Ultrahomogeneous Structures **(LNCS)

**Douglas Cenzer, Jeffrey Remmel and Mia Minnes. Injection structures specified by finite state transducers **(PRESENTATION)

**Uroš Čibej, Borut Robič and Jurij Mihelič. Empirical estimation of the halting probabilities **(PRESENTATION)

**Gabriel Ciobanu and Dragos Sburlan. Monitoring Changes in Dynamic Multiset Systems **(PRESENTATION)

**Gordana Dodig Crnkovic. Modeling Life as Cognitive Info-Computation **(LNCS)

**S. Barry Cooper and James Gay. Linear extensions of computably well-founded computable partial orders **(PRESENTATION)

**Bernat Corominas-Murtra. On the simplest transmission of meaning between autonomous agents **(PRESENTATION)

**Tess Crosbie. Testing the Robustness of a Literary Computer Analysis Framework Using Machine Translation **(PRESENTATION)

**Zoltán Ernő Csajbók and Tamás Mihálydeák. Maximal Parallelism in Membrane Systems with Generated Membrane Boundaries **(LNCS)

**Marek Czarnecki, Michał Tomasz Godziszewski and Dariusz Kalociński. Learnability Thesis does not entail Church's Thesis **(LNCS)

**Duilio D'Alfonso. Recursion: complexity from computation to cognition **(PRESENTATION)

**Ugo Dal Lago and Sara Zuppiroli. Probabilistic Recursion Theory and Implicit Computational Complexity **(PRESENTATION)

**Joseph Davidson and Greg Michaelson. Models and Modalities **(PRESENTATION)

**Nachum Dershowitz and Evgenia Falkovich. Generic Parallel Algorithms **(LNCS)

**Michiel De Smet and Andreas Weiermann. Phase transitions related to the pigeonhole principle **(LNCS)

**Rumen Dimitrov, Valentina Harizanov, Russell Miller and K. J. Mourad. Isomorphisms of Non-Standard Fields and Ash's Conjecture **(LNCS)

**István Elek. Can the intelligence emerge spontaneously in a not biological, artificial world? **(PRESENTATION)

**Christopher Engström and Sergei Silvestrov. A PageRank algorithm based on the structure of the graph **(PRESENTATION)

**Alessandro Facchini and Henryk Michalewski. Deciding the Borel complexity of regular tree languages **(LNCS)

**Michael Stephen Fiske. Toward a Mathematical Understanding of the Malware Problem **(PRESENTATION)

**Ekaterina Fokina, Pavel Semukhin and Daniel Turetsky. Degree spectra of structures under equivalence relations **(PRESENTATION)

**Enrico Formenti, Luca Manzoni and Antonio E. Porreca. Fixed Points and Attractors of Reaction Systems **(LNCS)

**Michèle Friend. Fallacies of Reasoning and the Logic of Partial Information **(PRESENTATION)

**Anthony Gasperin. Topology of Asymptotic Cones of a Space of Computations: A Characterization of Some Complexity Classes? **(PRESENTATION)

**Ivan Georgiev. Characterization Theorem for the Conditionally Computable Real Functions **(PRESENTATION)

**Federico Gobbo and Helena Durnová. From Universal to Programming Languages **(PRESENTATION)

**Michał Tomasz Godziszewski and Dariusz Kalociński. Computational Hardness of Mathematical Concepts and Algorithmic Learnability **(PRESENTATION)

**Cristian Gratie and Ion Petre. Fit-preserving data refinement of mass-action reaction networks **(LNCS)

**Charles Harris. On Maximal Block Functions of Computable eta-like Linear Orderings **(LNCS)

**Tamás Herendi and Roland Major. Random number generation on FPGA-s **(PRESENTATION)

**Eduardo Hermo-Reyes and Joost J. Joosten. Competing Computations **(PRESENTATION)

**Eduardo Hermo-Reyes, Joost J. Joosten and Laia Jornet-Somoza. Principles for Graded Turing Progressions **(PRESENTATION)

**Alberto Hernández-Espinosa and Francisco Hernández-Quiroz. The Principle of Computational Equivalence in the Cognitive Science Realm **(PRESENTATION)

**Oscar Ibarra, Cewei Cui, Zhe Dang and Thomas Fischer. Lossiness of Communication Channels Modeled by Transducers **(LNCS)

**Sergiu Ivanov, Elisabeth Pelz and Sergey Verlan. Small Universal Petri Nets with Inhibitor Arcs **(PRESENTATION)

**Akitoshi Kawamura and Arno Pauly. Function spaces for second-order polynomial time **(LNCS)

**Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick and Martin Ziegler. Smoothness+epsilon: Real Complexity on Gevrey’s Hierarchy **(PRESENTATION)

**Antonina Kolokolova and Renesa Nizamee. Approximating optimal solution structure with edit distance and its applications **(PRESENTATION)

**Michal Kovac. Inhibiting the Parallelism in P Systems **(PRESENTATION)

**Karen Lange, Russell Miller and Rebecca M. Steiner. Effective classification of computable structures **(PRESENTATION)

**Katalin A. Lázár. A Computational Model of XACML-Based Access Control Management in Distributed Networks **(LNCS)

**Jiamou Liu. The Ramsey Degrees of Ordinals Below $\omega^\omega$ **(PRESENTATION)

**Jack H. Lutz and Neil Lutz. Lines Missing Every Random Point **(LNCS)

**George Manis. A Randomized Algorithm for Faster Computation of Sample Entropy **(PRESENTATION)

**Simon McGregor. Natural Descriptions and Anthropic Bias: Extant Problems In Solomonoff Induction **(LNCS)

**Simon McGregor. Reflexivity - The Flip Side of Embodiment? **(PRESENTATION)

**Ludovic Mignot, Nadia Ouali Sebti and Djelloul Ziadi. An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations **(LNCS)

**Russell Miller, Reed Solomon and Rebecca M. Steiner. On the Effectiveness of Symmetry Breaking **(LNCS)

**Shota Murakami, Takeshi Yamazaki and Keita Yokoyama. On the Ramseyan factorization theorem **(LNCS)

**Benedek Nagy and Zita Kovács. On Special 5′ → 3′ Sensing Watson-Crick Finite-State Transducers **(PRESENTATION)

**Venkata Padmavati Metta and Alica Kelemenova. Parallel Spiking Neural P Systems with Anti-Spikes **(PRESENTATION)

**Ludovic Patey. On combinatorial weaknesses of Ramseyan principles **(PRESENTATION)

**Ludovic Patey. The complexity of satisfaction problems in Reverse Mathematics **(LNCS)

**Mikhail Peretyatkin. Infinitary first-order combinatorics as a basis for the computational level of expressive power of predicate logic **(PRESENTATION)

**Janos Posfai. Assessing the contributions of intrinsic and extrinsic factors to the establishment of brain functions **(PRESENTATION)

**Petrus H. Potgieter. Ramsey results for algorithmically random partitions of the rationals **(PRESENTATION)

**Giuseppe Primiero and Franco Raimondi. A typed natural deduction calculus to reason about secure messaging with trust **(PRESENTATION)

**Tahel Ronel and Alena Vencovská. Exchangeability in Binary Inductive Logic **(PRESENTATION)

**Sam Sanders. Continuity, intuitionism, and higher-order Reverse Mathematics **(PRESENTATION)

**Luca San Mauro. Towards a theory of computably enumerable graphs **(PRESENTATION)

**Anargyros Sarafopoulos. The Undecidability of the Inverse Problem for Iterated Function Systems **(PRESENTATION)

**Andrey Sariev. Definability of 0' in the structure of the $\omega$-enumeration degrees **(PRESENTATION)

**Marcin J. Schroeder. Life, Mind, and Computation in Physical World: Search for Common Framework **(PRESENTATION)

**Matthias Schroeder and Victor Selivanov. Hyperprojective Hierarchy of qcb_0-Spaces **(LNCS)

**Anton Setzer and Ulrich Berger. Undecidability of Equality for Codata Types **(PRESENTATION)

**Jian-Jun Shu. Quaternion Approach to DNA Sequence Alignment **(PRESENTATION)

**Alexandra A. Soskova. Joint spectra and Relative spectra of sequences of structures **(PRESENTATION)

**Naveen Sundar Govindarajulu and Selmer Bringsjord. Proof Verification Can Be Hard! **(PRESENTATION)

**Mariam Thalos. The Logic of Natural Selection **(PRESENTATION)

**Jeroen Van der Meeren. The Reverse Mathematics of Gap-sequences **(PRESENTATION)

**Peter van Emde Boas. Reconstructing games from stories; why we should want to do it and why it will be hard to do so **(PRESENTATION)

**Javier Vera, Eric Goles and Pedro Montealegre. Cellular Automata Approach to the Naming Game Model **(PRESENTATION)

**Philip Welch. Polynomial time on $\omega$-strings: a Church-like thesis **(PRESENTATION)

**Kevin Xu. The Enterprise-Participant Data Model, an Untyped Recursive Language Semantically Approximating the Lambda Calculus **(PRESENTATION)

**Mitko Yanchev. Description Logic with part restrictions: PSPACE-complete expressiveness **(PRESENTATION)

**Morcous Yassa. Supporting Interactive Collaboration In Knowledge Sharing Over Collaborative Networked Organization **(PRESENTATION)

**Stanislav Žák. Inherent logic and complexity **(PRESENTATION)

**Marius Zimand. Short lists with short programs in short time - a short proof **(LNCS)