Alphabetical List of Contributed Talks and Informal Presentations

• Kuanysh Abeshev and Serikzhan Badaev:
  A Note on Universal Numberings
• Nathanael L. Ackerman, Cameron E. Freer, and Daniel M. Roy:
  The Complexity of Computable Conditional Probability *
• Pavel Alaev:
  Computably Categorical Boolean Algebras Enriched by Ideals and Atoms *
• Thomas Anberrée:
  First-Order Universality for Real Programs
• Ulavappa B. Angadi and M.Venkatesulu:
  Automatic Classification of Protein Sequences into Families Using Elongated K-Mean Spectral Clustering
• Sergey Babenyshev, Vladimir Rybakov, and Renate Schmidt:
  Temporal Logic Treating Uncertainty and Interacting Agents with Time Indexes from {\cal Z}
• Timur Bakibayev:
  Comparing Nontriviality for the Exponential Time Classes E and EXP *
• Mathias Barra and Philipp Gerhardy:
  Skolem + Tetration is Well-Ordered
• Mathias Barra:
  Relativised Detour Degrees *
• Hannah Bayer and Markus Nebel:
  Evaluating Algorithms According to their Energy Consumption
• David R. Bélanger:
  Structures of Some Strong Reducibilities
• Amir ben-Amram and Lars Kristiansen:
  The Limits of Decidability and Tractability in Growth-Rate Analysis for Programs *
• Josef Berger:
  A Characterisation of BD-N
• Hendrik Blockeel and Robert Brijder:
  Learning Non-Confluent NLC Graph Grammar Rules
• Philipp Bodewig:
  Initial Segments of C.E. ibT-Degrees *
• Manuel Bodirsky, Miki Hermann, and Florian Richoux:
  Complexity of Existential Positive First-Order Logic
• Vasco Brattka and Guido Gherardi:
  Weihrauch Degrees, Omniscience Principles and Weak Computability *
• Paul Brodhead and Douglas Cenzer:
  Effective Capacity and Randomness of Closed Sets
• Paul Brodhead and Bjørn Kjos-Hanssen:
  Numberings and Randomness
• Paul Brodhead and Bjørn Kjos-Hanssen:
  The Strength of the Grätzer-Schmidt Theorem
• John Case and Samuel E. Moelius III:
  Program Self-Reference in Constructive Scott Subdomains
• Douglas Cenzer, Valentina Harizanov, and Jeffrey B. Remmel:
  \Sigma^0_1 and \Pi^0_1 Equivalence Structures
• Douglas Cenzer, Rebecca Weber, and Guohua Wu:
  Immunity for Closed Sets
• Jingchao Chen:
  Iterative Rounding for the Closest String Problem
• Yijia Chen, Jörg Flum, and Moritz Müller:
  Lower Bounds for Kernelizations and Other Preprocessing Procedures
• Karel Chvalovský:
  Independence of Axioms in Non-Classical Logics and ATP *
• Pieter Collins:
  Computable Types for Dynamic Systems
• Pieter Collins and Ivan S. Zapreev:
  Computable CTL for Discrete-Time and Continuous-Space Dynamic Systems
• Chris Conidis:
  The Reverse Mathematics of Artinian Rings *
• Graziana Conte:
  Modelling Quantum Information by Chu Spaces *
• Stefan Dantchev and Barnaby Martin:
  Cutting Planes and the Parameter Cutwidth
• Michiel De Smet and Andreas Weiermann:
  Phase Transitions Related to the Pigeonhole Principle *
• Angel V. Ditchev:
  On Least Enumerations of Partial Structures *
• Guénola Drillon:
  Combinatorics, Chromosomal Rearrangements and Reconstruction of Ancestral Genomes *
• Ross Duncan and Simon Perdrix:
  Graph States and the Necessity of Euler Decomposition
• Ömer Eğecioğlu and Oscar H. Ibarra:
  On Stateless Multicounter Machines
• Martín Escardó:
  Computability of Continuous Solutions of Higher-Type Equations
• Mark S. Everitt, Martin L. Jones, Vivien M. Kendon, Neil B. Lovett, and Robert C. Wagner:
  Quantum and Classical Analogue Computation Using Microwaves *
• Michael Fellows, Juraj Hromkovič, Frances Rosamond, and Monika Steinová:
  Fixed-Parameter Tractability, Relative Kernelization and the Effectivization of Structural Connections *
• Guido Fiorino:
  Taming Implications in Dummett Logic
• Willem L. Fouché:
  Fractals Generated by Algorithmically Random Brownian Motion
• Christophe Fouqueré:
  Computing Over Non-Linear Structures *
• Cameron E. Freer and Daniel M. Roy:
  Computable Exchangeable Sequences Have Computable de Finetti Measures
• Tobias Gärtner and Günter Hotz:
  Computability of Analytic Functions with Analytic Machines
• Christine Gaßner:
  Hierarchies below the Halting Problem for Additive Machines *
• Peter M. Gerdes:
  n-Tardy Sets *
• Matthew B. Giorgi, Thomas F. Kent, Andrew E. M. Lewis, and Andrea Sorbi:
  Empty Intervals of Enumeration Degrees and Strong Minimal Covers *
• L. Gordeev and A. Weiermann:
  Elaborating Critical Points of Phase Transitions *
• Binghui Guo, Wei Wei, and Zhiming Zheng:
  Constraint Message Propagation Dynamics of Nonlinear Boolean Equations
• Charles M. Harris:
  Noncuppable Enumeration Degrees Via Finite Injury *
• Armin Hemmerling:
  Function Operators Spanning the Arithmetical and the Polynomial Hierarchy
• Grzegorz Herman and Michael Soltys:
  Unambiguous Functions in Logarithmic Space
• Stefan Hetzl:
  On the Form of Witness Terms *
• Kojiro Higuchi and Takayuki Kihara:
  Notions of Reducibility for Mass Problems
• T. Hinze, R. Faßler, G. Escuela, B. Ibrahim, and S. Schuster:
  Computation by Synthetic Cell Signaling and Oscillating Processes Modelled Using Mass-Action Kinetics
• Mathieu Hoyrup and Cristóbal Rojas:
  An Application of Martin-Löf Randomness to Effective Probability Theory
• Sanjay Jain, Frank Stephan, and Jason Teutsch:
  Index Sets and Universal Numberings
• Norihiro Kamide:
  Strong Normalization of Program-Indexed Lambda Calculus
• Ján Kl'uka and Paul J. Voda:
  A Simple and Practical Valuation Tree Calculus for First-Order Logic
• Ekaterina Komendantskaya:
  Parallel Term Rewriting in Neural Networks *
• T. Kotek and J. A. Makowsky:
  Definability of Combinatorial Functions *
• Lars Kristiansen and Bedeho Mesghina Wolde Mender:
  The Semantics and Complexity of Successor-Free Nondeterministic Gödel's T and PCF *
• Oleg V. Kudinov and Victor L. Selivanov:
  A Gandy Theorem for Abstract Structures and Applications to First-Order Definability
• Oleg V. Kudinov, Victor L. Selivanov, and Anton V. Zhukov:
  Definability of Closure Operations in the h-Quasiorder of Labeled Forests
• Grégory Lafitte and Michael Weiss:
  Constructing New Aperiodic Self-Simulating Tile Sets
• James Lambert:
  The Relationship Between Measurability and Computability
• Gyesik Lee:
  Relationship Between Kanamori-McAloon Principle and Paris-Harrington Theorem
• Kyung Il Lee:
  Computably Well-Founded \omega-c.e. Linear Extensions *
• Andrew Lewis, André Nies, and Andrea Sorbi:
  The First Order Theories of the Medvedev and Muchnik Lattices
• Chung-Chih Li:
  Random Reference-Switching Functions *
• Chung-Chih Li:
  Union Theorems in Type-2 Computation
• Jiamou Liu:
  Dynamic Algorithms for Reachability Games *
• Jiang Liu, Shengling Wang, and Guohua Wu:
  Infima of d.r.e. Degrees
• Yanfang Ma and Yixiang Chen:
  Two-thirds Bisimulation Indexes
• Gunther Mainhardt:
  Some Properties of Traces as a Lattice under the Set Theoretic Inclusion *
• J. Raymundo Marcial-Romero, Claudia Zepeda, J. A. Hernández, Héctor A. Montes-Venegas, and Davin Linares:
  An Implementation of Exact Real Number Computation Based on LRT
• Klaus Meer:
  On Ladner's Result for a Class of Real Machines with Restricted Use of Constants
• Alexander G. Melnikov:
  0''-Categorical Completely Decomposable Torsion-Free Abelian Groups
• Benedek Nagy:
  On a Hierarchy of 5'->3' Sensing WK Finite Automata Languages
• Dag Normann:
  Sequential Functionals at Type Level 2 *
• J. B. Paris and A. Vencovská:
  A General Representation Theorem for Probability Functions Satisfying Spectrum Exchangeability
• Soumya Paul, R. Ramanujam, and Sunil Simon:
  Stability Under Strategy Switching
• Arno Pauly:
  Real Hypercomputation with Infinite Oracle Queries *
• Florian Pelupessy and Andreas Weiermann:
  Ackermannian Lower Bounds for Lengths of Bad Sequences of Monomial Ideals over Polynomial Rings in Two Variables
• G. Michele Pinna:
  Petri Nets Unfoldings and the Individual/Collective Token Philosophy
• Ian Pratt-Hartmann and Ivo Düntsch:
  Functions Definable by Arithmetic Circuits
• Sara Quinn:
  Index Sets and Scott Sentences *
• Jan Reimann:
  Algorithmic Reducibilities and Borel Equivalence Relations *
• Pavol Safarik:
  On the Computational Content of Bolzano-Weierstraß *
• Kentaro Sato:
  An Impact of Infinity: Comparison of Two Reverse Mathematices *
• Pavel Semukhin:
  Prime Models of Finite Computable Dimension
• Paul Shafer:
  A Characterization of the Join-Irreducible Medvedev Degrees *
• Alla Sirokofskich:
  Decidability of Sub-Theories of Polynomials over a Finite Field
• Alexandra A. Soskova and Ivan N. Soskov:
  Some Applications of the Jump Inversion Theorem for the Degree Spectra *
• Mariya I. Soskova and Ivan N. Soskov:
  Embedding Countable Partial Orderings in Degree Structures *
• Alexey Stukachev:
  On Semilattices of \Sigma-Degrees of Structures *
• Kohtaro Tadaki:
  Chaitin \Omega Numbers and Halting Problems
• Trifon Trifonov:
  Dialectica Interpretation with Fine Computational Control
• Mario Vélez and Juan Ospina:
  Generalized Temperley-Lieb Algebras and Quantum Computation
• Andreas Weiermann:
  A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
• Jiang Xin, Shaoting Tang, Lili Ma, Zhanli Zhang, and Zhiming Zheng:
  Random Diffusion and Congestion on Weighted Complex Networks
• Thomas Zerjatke:
  Solving a PSPACE-Complete Problem with DNA Computing *
• Marius Zimand:
  On Generating Independent Random Strings
• P. Zizzi and E. Pessa:
  On the Role of Quantum Metalanguage in Brain Quantum Computation *