Membrane computing (Monday, June 25, 2018)
| 15:30-16:30 | Lucie Ciencialová: New Developments in P Colonies |
| 16:30-16:45 | Coffee break |
| 16:45-17:15 | David Orellana-Martín, Luis Valencia-Cabrera, Mario J. Pérez-Jiménez: The factorization problem: A new approach through membrane systems |
| 17:15-18:15 | Artiom Alhazov: Matter-Antimatter Annihilation Rules in Membrane Computing |
| 18:15-18:35 | Sergiu Ivanov: A Note on Polymorphic P Systems |
| 18:35-19:00 | Rudolf Freund: Unfair P Systems |
You can download the proceedings
Decision making in nature (Tuesday, June 26, 2018)
| 15:30-16:10 | Makoto Naruse
Theory and Experiments of Photonic Decision Making |
| 16:10-16:50 | Taiki Takahashi
Neural and Quantum Computation in Decision Making over Time and under Uncertainty |
| 16:50-17:30 | Hirokazu Hori
Categorical Understanding of Value Alignment |
Physics and Computation (Tuesday, June 26, 2018)
| 11:00 – 12:00 | Keynote lecture: Oron Shagrir. Physical computability theses |
| 12:00-1400 | Lunch |
| 14:00 – 14:30 | Brian Coyle, Matty J. Hoban and Elham Kashefi. One Sided Device Independent Certification of Unbounded Random Numbers |
| 14:30 – 15:00 | Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen and Richard Hua. A Hybrid
Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing |
| 15:00-15:30 | Coffee Break |
| 15:30 – 16:00 | Timothy Schmitz. GRW Computing and Lessons for Physical Computation |
| 16:00 – 16:30 | Allan Randall. Objective and Subjective Solomonoff Probabilities in Quantum Mechanics |
| 16:30 – 17:30 | Keynote lecture: Judit Madarasz. Relativistic Computation |
| 17:30-17:45 | Break |
| 17:45 – 18:15 | Cyrille Imbert. Getting the advantages of theft without honest toil: Realism about the complexity of (some) physical systems without realist commitments to their scientific representations |
| 18:15 – 18:45 | Richard Whyman. An Atemporal Model of Physical Complexity |
| Time TBA | P&C Dinner |
Self-assembly, geometry and computation (Wednesday, June 27, 2018)
| 11:00-11:35 | M. Patitz: Universal Simulation of Directed Systems in the abstract Tile Assembly Model Requires Undirectedness |
| 11:35-12:00 | T. Stérin: Can n-bit Iterated Boolean Circuits count to 2^n? |
| 12:00-14:00 | Lunch+Business Meeting |
| 14:00-14:35 | D. Doty: Thermodynamic binding networks: How to self-assemble molecules reliably without knowing too much about them |
| 14:35-15:00 | T. Neary: Average-case NP-completeness in 2-tag systems |
| 15:00-15:30 | Coffee break |
| 15:30-16:05 | N. Schabanel: Folding shapes with oritatami systems |
| 16:05-16:30 | M. Cook: Self-assembly of Boolean functions with applications to 20 questions |
| 16:30-16:55 | G. Theyssier: Complexity and universality in freezing cellular automata |
| 17:00-17:25 | F. Becker: On the power of mismatch-free self-assembly |
| 17:25-18:00 | P.-E. Meunier: Negative and positive results on temperature 1 self-assembly |
| 18:00-18:25 | C. Evans: Simplifying implementable proofreading tile systems without increasing error rates |