Table of Contents

• Computing with Metabolic MachinesClaudio Angione, Giovanni Carapezza, Jole Costanza, Pietro Liò, Giuseppe Nicosia. 1-15 [doi]
• What kind of machine is the mind?Joscha Bach, Mario Verdicchio. 16-19 [doi]
• The Info-Computation Turn in PhysicsIsrael Belfer. 20-33 [doi]
• On Natural Representations of ObjectsFouad B. Chedid. 34-41 [doi]
• Turing's Influence on ProgrammingEdgar G. Daylight. 42-52 [doi]
• Computing Nash Equilibria of Unbounded GamesMartín Hötzel Escardó, Paulo Oliva. 53-65 [doi]
• Turing Incomputable ComputationMichael Stephen Fiske. 66-91 [doi]
• The chess example in Turing's Mind paper is really about ambiguityJeroen Fokker. 92-97 [doi]
• Ultrametric automata and Turing machinesRusins Freivalds. 98-112 [doi]
• Molecular computations with competitive neural networks that exploit linear and nonlinear kineticsAnthony J. Genot, Teruo Fujii, Yannick Rondelez. 113-117 [doi]
• Secure Communication over Zero-Private Capacity Quantum ChannelsLaszlo Gyongyosi, Sándor Imre. 118-131 [doi]
• On the Mathematical Boundaries of Communication with Zero-Capacity Quantum ChannelsLaszlo Gyongyosi, Sándor Imre. 132-139 [doi]
• Turing Tests with Turing MachinesJosé Hernández-Orallo, Javier Insa-Cabrera, David L. Dowe, Bill Hibbard. 140-156 [doi]
• Logic, Probability, and Privacy: A Framework for Specifying Privacy RequirementsTsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang. 157-167 [doi]
• Generalizations of Rice's Theorem, Applicable to Executable and Non-Executable FormalismsCornelis Huizing, Ruurd Kuiper, Tom Verhoeff. 168-180 [doi]
• Graph Symmetry Detection and Canonical Labeling: Differences and SynergiesHadi Katebi, Karem A. Sakallah, Igor L. Markov. 181-195 [doi]
• A Note on Turing's Three Pioneering Initiatives and on Their InterplaysJozef Kelemen. 196-203 [doi]
• Alternating Turing machines and the analytical hierarchyDaniel Leivant. 204-213 [doi]
• Vector Addition Systems Reachability Problem (A Simpler Solution)Jérôme Leroux. 214-228 [doi]
• Utilizing Hoare Logic to Strengthen Testing for Error Detection in ProgramsShaoying Liu. 229-238 [doi]
• The Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed ComputingRao Mikkilineni, Albert Comparini, Giovanni Morana. 239-251 [doi]
• The Glory of the Past and Geometrical ConcurrencyCristian Prisacariu. 252-267 [doi]
• On the Impact of Information Technologies on Society: an Historical Perspective through the Game of ChessFrédéric Prost. 268-277 [doi]
• The computing power of Turing machine based on quantum logicYun Shang, Xian Lu, Ruqian Lu. 278-288 [doi]
• Feature Selection EnsembleQiang Shen, Ren Diao, Pan Su. 289-306 [doi]
• Towards an Expressive Practical Logical Action TheoryMikhail Soutchanski, Wael Yehia. 307-325 [doi]
• A Unified View of Induction Reasoning for First-Order LogicSorin Stratulat. 326-352 [doi]
• Towards an Information-Theoretic Approach to Population StructureOmri Tal. 353-369 [doi]
• The Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar FormsTony Veale. 370-385 [doi]
• Unifying Equivalences for Timed Transition SystemsIrina Virbitskaite, Natalya Gribovskaya, Eike Best. 386-404 [doi]
• Computational Completeness of Interaction Machines and Turing MachinesPeter Wegner, Eugene Eberbach, Mark Burgin. 405-414 [doi]
• The Frame Problem and the Semantics of Classical ProofsGraham White. 415-429 [doi]