1,275
Views
0
CrossRef citations to date
0
Altmetric
Preface

Logics for unconventional computing

Pages 233-236 | Received 14 Dec 2017, Accepted 14 Dec 2017, Published online: 21 Mar 2018

References

  • Adamatzky A. East-west paths to unconventional computing. Prog Biophys Mol Biol. 2017;131:469–493.
  • Koblitz N. p-adic numbers, p-adic analysis and Zeta-functions. New-York (NY): Springer-Verlag; 1984.
  • Petri C. Kommunikation mit automaten. Schriften des IIM nr. 2. Bonn: Institut für Instrumentelle Mathematik; 1962.
  • Schumann A. Payoff cellular automata and reflexive games. J Cell Automata. 2014;9:287–313.
  • Abramsky S, Jagadeesan R. Games and full completeness for multiplicative linear logic. J Symbolic Logic. 1994;59(2):543–574.
  • Abramsky S, Mellies PA. Concurrent games and full completeness. In: Proceedings of the 14th Symposium on Logic in Computer Science. Washington, DC; 1999. p. 431–442.
  • Tversky A, Kahneman D. Extensional vs. intuitive reasoning: the conjuctive fallacy in probability judgement. Psychological Rev. 1984;90(4):293–315.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.