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

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

9.00-9.25 |
C. Gratie and I. PetreFit-preserving data refinement of mass-action reaction networks |
K. Lange, R. Miller and R. M. SteinerEffective classification of computable structures |
S. B. Cooper and J. GayLinear extensions of computably well-founded computable partial orders |
M. J. SchroederLife, Mind, and Computation in Physical World: Search for Common Framework |
N. S. Govindarajulu and S. BringsjordProof Verification Can Be Hard! |
||||||||||

9.30-9.55 |
K. A. LázárA Computational Model of XACML-Based Access Control Management in Distributed Networks |
L. San MauroTowards a theory of computably enumerable graphs |
E. Fokina, P. Semukhin and D. TuretskyDegree spectra of structures under equivalence relations |
A. Hernandez-Espinosa and F. Hernández-QuirozThe Principle of Computational Equivalence in the Cognitive Science Realm |
T. Ronel and A. VencovskaExchangeability in Binary Inductive Logic |
||||||||||

10.00-10.25 |
P. Battyányi and Gy. VaszilMembrane systems and the chemical computing paradigm |
M. Czarnecki, M. T. Godziszewski and D. KalocińskiLearnability Thesis does not entail Church's Thesis |
Ch. HarrisOn Maximal Block Functions of Computable eta-like Linear Orderings |
S. McGregorReflexivity - The Flip Side of Embodiment? |
E. Hermo-Reyes, J. Joosten and L. Jornet-SomozaPrinciples for Graded Turing Progressions |
||||||||||

10.30-10.55 |
M. KovacUsing Inhibitors to Achieve Universality of Sequential P Systems |
M. Cai, H. Ganchev, S. Lempp, J. S. Miller and M. SoskovaKalimullin pairs and definability in the enumeration degrees |
C. BrillowskiElements of Self-Hosting Languages |
U. Dal Lago and S. ZuppiroliProbabilistic Recursion Theory and Implicit Computational Complexity |
A. AchilleosModal Logics with Hard Diamond-free Fragments |
||||||||||

11.00-11.30 |
Coffee break | ||||||||||||||

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

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

Online algorithms | Bio-inspired computation | Complexity in Automata Theory | |||||||||||||

11.30-12.15 |
Online bin packing: Old algorithms and new results |
The FPGA-based High-Performance Computer RIVYERA for Applications in Bioinformatics |
Solving compressed (membership) problems by recompression |
||||||||||||

12.15-13.00 |
Beyond Competitive Analysis - why and how |
Using Membrane Features to Compute |
On the Ultimate Positivity Problem for Linear Recurrence Sequences |
||||||||||||

13.00-14.30 |
Lunch | ||||||||||||||

14:30-15.30 |
Universal Prediction |
||||||||||||||

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

16.00-17.00 |
Games, Learning and the Price of Anarchy |
||||||||||||||

17.00-17.15 |
Presentation of CiE 2015 | ||||||||||||||

17.15-17.30 |
Closing |