Bogdan Aman and Gabriel Ciobanu:
Mobile Ambients and Mobile Membranes

Alexander Melnikov:
Enumerations and Torsion Free Abelian Groups

Joel David Hamkins and Russell Miller:
Post's Problem for Ordinal Register Machines

Ferruccio Guidi:
Lambda Types on the Lambda Calculus with Abbreviations

Bruno Loff:
A Functional Characterisation of the Analytical Hierarchy

Kostyantyn Archangelsky:
A New Approach to the Uncounting Problem for Regular Languages

Stéfane Le Roux:
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria

10:30

Nadia Busi and Claudio Zandron:
Computing with Genetic Gates

Alexey Stukachev:
Effective Reducibilities on Structures and Degrees of Presentability

Peter Koepke and Benjamin Seyfferth:
Doing α-Recursion Theory with Ordinal Machines

Kentaro Kikuchi:
Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus

Luis Mendes Gomes and Jose Felix Costa:
Hybrid Finite Computation

Liesbeth De Mol:
Generating Number Sequences Through Periodic Structures in Tag Systems

Josep Freixas, Xavier Molinero and Salvador Roura:
Minimal Representations for Majority Games

10:50

Francesco Bernardini, Marian Gheorghe, Maurice Margenstern and Sergey Verlan:
Producer/ Consumer in Membrane Systems and Petri Nets

Bahareh Afshari:
Information Content and Computability in the n-C.E. Hierarchy II

Branislav Rovan and Lubos Steskal:
Infinite Computations and a Hierarchy in Δ₃

Josef Berger:
Weak Koenig's Lemma Implies the Fan Theorem for c-bars

Kerry Ojakian:
Some New Approaches to Characterizing Computable Analysis by Analog Computation

Olivier Finkel and Dominique Lecomte:
There Exist Some ω-Powers of Any Borel Rank

Martin Olsen:
Nash Stability in Additively Separable Hedonic Games is NP-hard

11:10

Ivan Soskov:
The Jump Operator on the ω-Enumeration Degrees

Alla Sirokofskich:
Counting, Collection and the Weak Pigeon-hole Principle

Sebastian Dörn:
Quantum Algorithms for Graph Traversals and Related Problems

Adrien Revault d'Allonnes, Herman Akdag and Olivier Poirel:
Trust- moderated Information- likelihood. A Multi-valued Logics Approach

Argimiro Arratia and Carlos Ortiz:
Syntactic Approximations to Computational Complexity Classes

Alexandre Borovik and Şükrü Yalçinkaya:
Black Box Groups: Guesswork, Computation, Proof

Domenico Lenzi:
On a Constructive Proof of Completeness of Positive Implicational Propositional Calculus

08:30

Hristo Ganchev:
Exact Pair Theorem for the ω-Enumeration Degrees

Sam Sanders, Chris Impens and Andreas Weiermann:
What If Computers Could Count To Infinity?

Juan Ospina and Mario Velez:
Universal Quantum Computation via Yang- Baxterization of the Two-colour Birman-Wenzl- Murakami Algebra

Giangiacomo Gerla:
Multi-valued Logics, Effectiveness and Domains

Mathias Barra, Lars Kristiansen and Paul Voda:
Nondeterminism Without Turing Machines

Oleg Kudinov and Victor Selivanov:
Definability in the Homomorphic Quasiorder of Finite Labeled Forests

Peter Schuster:
Problems as Solutions

08:50

Mariya Ivanova Soskova:
A Non-splitting Theorem in the Enumeration Degrees

Andres Cordon-Franco, Alejandro Fernandez- Margarit and Francisco Felix Lara-Martin:
On Rules and Parameter Free Systems in Bounded Arithmetic

Ellie D'Hondt:
About Quantum Graph Colouring

Jens Blanck:
Framework for Comparing Domain Representations

Frances A. Rosamond and Michael Fellows:
Why is P Not Equal to NP?

Florin Manea and Victor Mitrana:
Hairpin Completion Versus Hairpin Reduction

Sandra Alves, Maribel Fernandez, Mario Florido and Ian Mackie:
Very Primitive Recursive Functions

09:10

Luigi Acerbi, Alberto Dennunzio and Enrico Formenti:
Shifting and Lifting of Cellular Automata

Douglas Cenzer, Geoffrey LaForte and Guohua Wu:
Pseudojump Operators and Π⁰₁ Classes

Antonino Drago:
Four Ways of Logical Arguing in Theoretical Physics

Marco Pedicini and Mario Piazza:
Elementary Complexity into the Hyperfinite II1 Factor

Maxime Amblard and Christian Retore:
Natural Deduction and Normalisation for Partially Commutative Linear Calculi Used in Concurrency Theory and Computational Linguistic

Giuditta Franco:
Membrane Dynamical Systems: Open Problems

Armando Matos, Andreia Teixeira and Andre Souto:
Non-deterministic Communication Complexity and Instance Complexity

16:00

Julien Cervelle, Enrico Formenti and Pierre Guillon:
Sofic Trace Subshift of a Cellular Automaton

Rongfang Bie and Guohua Wu:
A Minimal Pair in the Quotient Structure M/NCup

Bruno Marchal:
A Purely Arithmetical, yet Empirically Falsifiable, Interpretation of Plotinus' Theory of Matter

Paola Anna Zizzi:
Turning the Liar Paradox into a Metatheorem of Basic Logic

Alberto Marcone:
The Strength of Fraïssé's Conjecture for Finite Hausdorff Rank

Tseren-Onolt Ishdorj, Ion Petre and Vladimir Rogojin:
Computational Power of Intramolecular Gene Assembly

Joel Friedman:
Linear Transformations in Boolean Complexity Theory

16:20

Sung-Jin Cho, Un-Sook Choi, Han-Doo Kim, Yoon-Hee Hwang and Jin-Gyoung Kim:
Pseudorandom Number Generation Based on 90/150 Linear Nongroup Cellular Automata

Sergei Podzorov:
On Isomorphism Type of Some Structures in Many-One Degrees

Zvonimir Šikić:
Gödel's Incompleteness Theorem and Man-Machine Non-equivalence

Maria Luisa Dalla Chiara, Roberto Giuntini and Roberto Leporini:
Concrete and Abstract Quantum Computational Logics

Guillaume Bonfante, Matthieu Kaczmarek and Jean-Yves Marion:
Classification of Viruses through Recursion Theorems

James Lathrop, Jack H. Lutz and Scott M. Summers:
Strict Self-Assembly of Discrete Sierpinski Triangles

Oriana Ponta:
A Fixed-Parameter Approach to the Convex Recoloring Problem

16:40

John Case and Samuel Moelius:
Characterizing Programming Systems Allowing Program Self-Reference

Jennifer Chubb, John Chisholm, Valentina S. Harizanov, Denis Hirschfeldt, Carl G. Jockusch, Jr., Timothy McNicholl, and Sarah Pingrey:
Strong Degree Spectra of Initial Segments of Scattered Linear Orders

Adam Obtulowicz:
Multigraph Membrane Systems: a Visual Formalism for Modeling Complex Systems in Biology and Evolving Neural Networks

Stefan Dantchev:
Towards a Logical Characterisation of and Complexity Gap Theorems for Resolution-based Propositional Proof Systems

Guido Gherardi:
Internal Computability

Ofer Arieli:
Paraconsistent Reasoning and Distance Minimization

Mingji Xia:
Universal Match Gates

16:00

Eiju Hirowatari, Kouichi Hirata and Tetsuhiro Miyahara:
Learnability of Recursively Enumerable Sets of Recursive Real-Valued Functions

Mariya Ivanova Soskova and Guohua Wu:
Cupping Δ₂ Enumeration Degrees to 0_e'

Remco Loos:
On Accepting Networks of Splicing Processors of Size 3

Mark Rhodes:
Rank Lower Bounds for the Sherali-Adams Operator

Iraj Kalantari and Larry Welch:
On Turing Degrees of Points in Computable Topology

Sujata Ghosh:
Belief Flow Networks

Fatih Basciftci:
Exact Direct Cover Minimization Algorithm for a Single Output of Switching Functions

16:20

Yohji Akama:
Omega-Rules and Learnability

Iskander Kalimullin:
Some Notes on Degree Spectra of the Structures

S. N. Krishna:
On the Computational Power of Flip-Flop Proteins on Membranes

Nicola Galesi and Massimo Lauria:
Complexity of Proofs in Extensions of the Polynomial Calculus

Laurent Bienvenu, Wolfgang Merkle and Alexander Shen:
Some Results and Questions in Effective Measure Theory

Carlos Lourenço:
How Can Natural Brains Help Us Compute?

Peng Zhang:
Approximating Generalized Multicut on Trees

16:40

Russell Miller:
Locally Computable Structures

Luis Antunes, Armindo Costa, Armando Matos and Paul Vitanyi:
Computational Depth of Infinite Strings Revisited

Benedek Nagy and Remco Loos:
Parallelism in DNA and Membrane Computing

Jose Espirito Santo:
Refocusing Generalised Normalisation

Fan Yun , Decheng Ding and Xizhong Zheng:
Totally d-c.e. Real Numbers

Annelies Gerber:
Resolution Proofs Hidden in Mathematical and Physical Structures and Complexity

Mihai Prunescu:
Self-similar Carpets Associated with the Odd Primes

17:00

Vasco Brattka and Guido Gherardi:
Borel Complexity of Topological Operations on Computable Metric Spaces

Chih-Hao Lin and Jiun-De He:
A Multiple- Evaluation Genetic Algorithm for Numerical Optimization Problems

Ying Gao and Jingde Cheng:
Operational Semantics for Positive Relevant Logics without Distribution

Barnaby Dawson:
Alpha Recursion and Ordinal Time Turing Machines

Richard Alo:
Minority Serving Institutions (MSI)- CyberInfrastructure (CI) Empowerment Coalition (MSI-CIEC)

17:20

Karim Djemame, Iain Gourlay and James Padgett:
Risk-Aware Grid Resource Brokering

Andrew Lewis, Antonio Montalban and Andre Nies:
A Weakly 2-Random Set that is not Generalized Low

Zhuldyz Talasbayeva:
On Computability in Ershov's Hierarchy

Barnaby Martin and Florent Madelaine:
Hierarchies in Fragments of Monadic Strict NP

Gregorio de Miguel Casado, Juan Manuel Garcia and Maria Teresa Signes Pont:
Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers

Jerome Durand-Lose:
Abstract Geometrical Computation and Linear BSS

Jens Blanck:
Framework for Comparing Domain Representations

08:30

Gyesik Lee:
Binary Trees and (Maximal) Order Types

Joseph S. Miller:
Weak Lowness Properties and Randomness

Ekaterina Fokina:
Decidable Theories of Computable Structures

Mia Minnes and Bakhadyr Khoussainov:
Solution to a Problem of Vardi on Ordinal Heights of Well-founded Automatic Relations

Margarita Korovina and Oleg Kudinov:
The Uniformity Principle for Σ-definability with Applications to Computable Analysis

Pieter Collins:
Computability of the Evolution of Hybrid Dynamical Systems

Fredrik Dahlgren:
Effective Structure Theorems for Spaces of Compactly Supported Distributions

08:50

Peter Hancock:
Continuous Stream Processing and a Generalisation

Anthony Morphett and George Barmpalias:
Almost-Everywhere Domination, Non-cupping and LR-reducibility

Boris Solon:
Co-total Enumeration Degrees. Part 2

Olaf Beyersdorff:
The Deduction Theorem, Optimal Proof Systems, and Complete Disjoint NP-Pairs

Laurent Bienvenu, David Doty and Frank Stephan:
Constructive Dimension and Weak Truth-Table Degrees

Raffaella Gentilini, Bud Mishra, and Klaus Schneider:
Automated Abstraction- Refinement of Hybrid Automata for Monotonic CTL Model Checking

Yixiang Chen and Hengyang Wu:
Semantics of Sub-Probabilistic Programs

09:10

David Linetsky, Joel David Hamkins and Russell Miller:
The Complexity of Quickly Decidable ORM Sets

Douglas Cenzer, George Barmpalias, Jeffrey Remmel and Rebecca Weber:
K-trivial Closed Sets and Continuous Functions

Victor Selivanov:
A Useful Undecidable Theory

Frances A. Rosamond and Michael Fellows:
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number

Stefano Galatolo:
Computable Measures and Dynamical Systems

Robin Hirsch and Evan Tzanis:
A Logic for Probabilistic XML Documents with Applications to Updates

Graçaliz Dimuro and Antonio Carlos Costa:
Towards a Domain-theoretic Model of Developmental Machines

09:30

Christine Gaßner:
P = NP for Expansions Derived from Some Oracles

David Doty and Philippe Moser:
Feasible Depth

Gregory Lafitte and Christophe Papazian:
The Fabric of Small Turing Machines

Zhimin Li, Libo Lo and Xiang Li:
On the Computational Complexity of the Theory of Complete Binary Trees

Elzbieta Nowicka and Marcin Zawada:
On the Complexity of Matching Non-injective General Episodes

Norman Danner and James Royer:
Time-complexity Semantics for Feasible Affine Recursions

Paula Quinon and Konrad Zdanowski:
The Intended Model of Arithmetic. An Argument from Tennenbaum's Theorem

09:50

Alexandre Pinto:
Comparing Notions of Computational Entropy

Alexandra Soskova:
A Jump Inversion Theorem for the Degree Spectra

Chung-Chih Li:
Speed-up Theorems in Type-2 Computation

Iain Stewart:
Logically Capturing Complexity Classes Within the Polynomial Hierarchy

Mashudu Makananise and Vasco Brattka:
Limit Computable Functions

10:10