Logics for unconventional computing

Abstract Logics for unconventional computing is an interdisciplinary research area which brings together computer scientists and engineers dealing with unconventional computing (such as biological, bio-inspired, chemical, physical, etc. computing) with logicians dealing with non-classical logical, algebraic, co-algebraic, and topological methods to initiate the development of novel nature-inspired computation paradigms. This paper is a Preface to the special issue devoted to Logics for unconventional computing. Graphical Abstract

[1]  N. Koblitz.  p-adic Numbers, p-adic Analysis, and Zeta-Functions , 1977 .

[2]  A. Tversky,et al.  Extensional versus intuitive reasoning: the conjunction fallacy in probability judgment , 1983 .

[3]  C. Petri.  Kommunikation mit Automaten , 1962 .

[4]  Samson Abramsky,et al.  Concurrent games and full completeness , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[5]  Andrew Schumann.  Payoff Cellular Automata and Reflexive Games , 2014, J. Cell. Autom..

[6]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..

[7]  Susan Stepney,et al.  East-West paths to unconventional computing. , 2017, Progress in biophysics and molecular biology.