| Claudio Angione, Giovanni Carapezza, Jole Costanza, Pietro Lio and Giuseppe Nicosia | Computing with Metabolic Machines | 1-15 |  |
| Joscha Bach and Mario Verdicchio | What kind of machine is the mind? | 16-19 | |
| Israel Belfer | The Info-Computation Turn in Physics | 20-33 | |
| Fouad Chedid | On Natural Representations of Objects | 34-41 | |
| Edgar G. Daylight | Turing's Influence on Programming | 42-52 | |
| Martin Escardo and Paulo Oliva | Computing Nash Equilibria of Unbounded Games | 53-65 | |
| Michael Stephen Fiske | Turing Incomputable Computation | 66-91 | |
| Jeroen Fokker | The chess example in Turing's Mind paper is really about ambiguity | 92-97 | |
| Rusins Freivalds | Ultrametric automata and Turing machines | 98-112 | |
| Anthony J. Genot, Teruo Fujii and Yannick Rondelez | Molecular computations with competitive neural networks that exploit linear and nonlinear kinetics | 113-117 | |
| Laszlo Gyongyosi and Sandor Imre | Secure Communication over Zero-Private Capacity Quantum Channels | 118-131 | |
| Laszlo Gyongyosi and Sandor Imre | On the Mathematical Boundaries of Communication with Zero-Capacity Quantum Channels | 132-139 | |
| Jose Hernandez-Orallo, Javier Insa, David Dowe and Bill Hibbard | Turing Tests with Turing Machines | 140-156 | |
| Tsan-Sheng Hsu, Churn-Jung Liau and Da-Wei Wang | Logic, Probability, and Privacy: A Framework for Specifying Privacy Requirements | 157-167 | |
| Cornelis Huizing, Ruurd Kuiper and Tom Verhoeff | Generalizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms | 168-180 | |
| Hadi Katebi, Karem A. Sakallah and Igor L. Markov | Graph Symmetry Detection and Canonical Labeling: Differences and Synergies | 181-195 | |
| Jozef Kelemen | A Note on Turing’s Three Pioneering Initiatives and on Their Interplays | 196-203 | |
| Daniel Leivant | Alternating Turing machines and the analytical hierarchy | 204-213 | |
| Jerome Leroux | Vector Addition Systems Reachability Problem (A Simpler Solution) | 214-228 | |
| Shaoying Liu | Utilizing Hoare Logic to Strengthen Testing for Error Detection in Programs | 229-238 | |
| Rao Mikkilineni, Albert Comparini and Giovanni Morana | The Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing | 239-251 | |
| Cristian Prisacariu | The Glory of the Past and Geometrical Concurrency | 252-267 | |
| Frederic Prost | On the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess | 268-277 | |
| Yun Shang, Xian Lu and Ruqian Lu | The computing power of Turing machine based on quantum logic | 278-288 | |
| Qiang Shen, Ren Diao and Pan Su | Feature Selection Ensemble | 289-306 | |
| Mikhail Soutchanski and Wael Yehia | Towards an Expressive Practical Logical Action Theory | 307-325 | |
| Sorin Stratulat | A Unified View of Induction Reasoning for First-Order Logic | 326-352 | |
| Omri Tal | Towards an Information-Theoretic Approach to Population Structure | 353-369 | |
| Tony Veale | The Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms | 370-385 | |
| Irina Virbitskaite, Natalya Gribovskaya and Eike Best | Unifying Equivalences for Timed Transition Systems | 386-404 | |
| Peter Wegner, Eugene Eberbach and Mark Burgin | Computational Completeness of Interaction Machines and Turing Machines | 405-414 | |
| Graham White | The Frame Problem and the Semantics of Classical Proofs | 415-429 | |
