Contributed talks |
|||||||||||||||

Room A |
Room B |
Room C |
Room D |
Room E |
|||||||||||

8.30-8.55 |
O. Ibarra, C. Cui, Zhe Dang and Th. FischerLossiness of Communication Channels Modeled by Transducers |
A. Kawamura and A. Pauly Function spaces for second-order polynomial time |
S. Murakami, T. Yamazaki and K. Yokoyama On the Ramseyan factorization theorem |
E. Hermo Reyes and J. J. JoostenCompeting Computations |
Z. E. Csajbók and T. Mihálydeák Maximal Parallelism in Membrane Systems with Generated Membrane Boundaries |
||||||||||

9.00-9.25 |
D. Cenzer, J. Remmel and M. Minnes Injection structures specified by finite state transducers |
C. Bazgan, M. Chopin, A. Nichterlein and F. SikoraParameterized Inapproximability of Target Set Selection and Generalizations |
P. H. PotgieterRamsey results for algorithmically random partitions of the rationals |
P. van Emde BoasReconstructing games from stories; why we should want to do it and why it will be hard to do so |
E. Formenti, L. Manzoni and A. E. PorrecaFixed Points and Attractors of Reaction Systems |
||||||||||

9.30-9.55 |
S. Broda, A. Machiavelo, N. Moreira and R. ReisOn the Equivalence of Automata for KAT-expressions |
A. Kawamura, N. Th. Müller, C. Rösnick and M. Ziegler Smoothness+epsilon: Real Complexity on Gevrey’s Hierarchy |
Jiamou LiuThe Ramsey Degrees of Ordinals Below ω^{ω} |
M. De Smet and A. WeiermannPhase transitions related to the pigeonhole principle |
B. Nagy and Z. KovácsOn Special 5′ → 3′ Sensing Watson-Crick Finite-State Transducers |
||||||||||

10.00-10.25 |
L. Mignot, N. Ouali Sebti and D. ZiadiAn Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations |
M. Schroeder and V. SelivanovHyperprojective Hierarchy of qcb-Spaces_{0} |
L. Patey On combinatorial weaknesses of Ramseyan principles |
S. McGregorNatural Descriptions and Anthropic Bias: Extant Problems In Solomonoff Induction |
Jian-Jun ShuQuaternion Approach to DNA Sequence Alignment |
||||||||||

10.30-11.00 |
Coffee break | ||||||||||||||

Special Sessions |
|||||||||||||||

Room A |
Room B |
Room C |
|||||||||||||

Computational Linguistics | History and Philosophy of Computing | Computability | |||||||||||||

11.00-11.45 |
Transforming data to satisfy hunger of the new knowledge era |
Algorithms and Their Explanations |
Lowness and automorphisms of the c.e. sets |
||||||||||||

11.45-12.30 |
Graph Transformations for Computational Linguistics |
An early completion algorithm: Thue's 1914 paper on the transformation of symbol sequences |
Limitwise monotonicity in the linear orderings |
||||||||||||

12.30-14.00 |
Lunch | ||||||||||||||

Contributed talks |
|||||||||||||||

Room A |
Room B |
Room C |
Room D |
Room E |
|||||||||||

14.00-14.25 |
M. ZimandShort lists with short programs in short time - a short proof |
A. SarafopoulosThe Undecidability of the Inverse Problem for Iterated Function Systems |
L. PateyThe complexity of satisfaction problems in Reverse Mathematics |
Ch. Engström and S. SilvestrovA PageRank algorithm based on the structure of the graph |
M. CarlAlgorithmic Randomness for Infinite Time Register Machines |
||||||||||

14.30-14.55 |
L. Brown WestrickEffective Dimension in Subshifts |
J. Cabessa and A. VillaOn Interactively Computable Functions |
S. SandersContinuity, intuitionism, and higher-order Reverse Mathematics |
R. Miller, R. Solomon and R. M. SteinerOn the Effectiveness of Symmetry Breaking |
G. ManisA Randomized Algorithm for Faster Computation of Sample Entropy |
||||||||||

15.00-15.25 |
B. Corominas-Murtra On the simplest transmission of meaning between autonomous agents |
I. GeorgievCharacterization Theorem for the Conditionally Computable Real Functions |
J. Van der Meeren The Reverse Mathematics of Gap-sequences |
S. Ivanov, E. Pelz and S. Verlan Small Universal Petri Nets with Inhibitor Arcs |
T. Herendi and R. Major Random number generation on FPGA-s |
||||||||||

15.30-16.00 |
Coffee break | ||||||||||||||

16:00-17.00 |
Logic and Automata |
||||||||||||||

17.00-18.00 |
Conservation and co-evolution: from sequence analysis to protein-protein interactions |
||||||||||||||

18.00-19.00 |
Women in Computability workshop |