Modelling distributive computation by selective machines

References

• Wegner P. Why interaction is more powerful than algorithms. Commun ACM. 1997;40:80–91.
   Web of Science ®Google Scholar
• Wegner P, Eberbach E. New models of computation. Comput J. 2004;47:4–9.
   Web of Science ®Google Scholar
• Wegner P, Goldin D. Principles of problem solving. Commun ACM. 1997;49:27–29.
   Google Scholar
• Cockshott P, Michaelson G. Are there new models of computation? Reply to Wegner and Eberbach. Comput J. 2007;50(2):232–247.
   Web of Science ®Google Scholar
• Davis M. The myth of hypercomputation. In: Teuscher C., editor. Alan Turing: life and legacy of a great thinker. Berlin: Springer-Verlag; 2003. p. 195–211
   Google Scholar
• Teuscher C, Sipper M. Hypercomputation: hype or computation? Commun ACM. 2002;45(8):23–24.
   Web of Science ®Google Scholar
• Burgin M. Superrecursive features of interactive computation. Preprint in Comput Sci. 2007. http://arXiv.org.
   Google Scholar
• Burgin M. Interactive hypercomputation. In: Proceedings of the 2007 International Conference on Foundations of Computer Science (FCS'07). Las Vegas, NV: CSREA Press; 2007a. p. 328–333.
   Google Scholar
• Burgin M. Super-recursive algorithms. Heidelberg: Springer; 2005.
   Google Scholar
• Burgin M. Grammars with prohibition and human-computer interaction. In: Proceedings of the business and industry simulation symposium, Society for Modeling and Simulation International. San Diego, CA: International Society for Modeling and Simulation; 2005a. p. 143–147.
   Google Scholar
• Burgin M. Basic classes of grammars with prohibition. Preprint in Comput Sci. 2013. 15 p. cs.FL/CL. 1302.5181.
   Google Scholar
• Burgin M. Grammars with exclusion. J Comput Technol Appl (JoCTA). 2015;6(2):56–66.
   Google Scholar
• Carlucci L, Case J, Jain S. Learning correction grammars. J Symb Logic. 2009;74:489–516.
   Web of Science ®Google Scholar
• Case J, Jain S. Rice and Rice-Shapiro theorems for transfinite correction grammars. Math Logic Quart. 2011;57(5):504–516.
   Web of Science ®Google Scholar
• Case J, Royer J. Program size complexity of correction grammars in the Ershov hierarchy. In: 12th Conference of Computability in Europe (CiE 2016), Proceedings, lecture notes in Computer Science, vol. 7921. Heidelberg: Springer; 2016. p. 240–250.
   Google Scholar
• Burgin M. Measuring power of algorithms, computer programs, and information automata. New York: Nova Science Publishers; 2010.
   Google Scholar
• Burgin M. Decidability and universality in the axiomatic theory of computability and algorithms. Int J Found Comput Sci. 2012;23(7):1465–1480.
   Web of Science ®Google Scholar
• Codd EF. Cellular automata. New York: Academic; 1968.
   Google Scholar
• Haykin S. Neural networks: a comprehensive foundation. New York: Macmillan; 1994.
   Google Scholar
• Bengio Y. Learning deep architectures for AI. Found Trends Mach Learn. 2009;2(1). p. 1–56
   Google Scholar
• Graves A, Wayne G, Danihelka I. Neural turing machines. arXiv:1410.5401; 2014.
   Google Scholar
• Collier M, Beel J. Implementing neural Turing machines. Artif Neural Netw Mach Learn. 2018;2018:94–104.
   Google Scholar
• Sipser M. Introduction to the theory of computation. Boston (MA): PWS Publishing Co.; 1997.
   Google Scholar
• Burgin M, Adamatzky A. Structural machines and slime mold computation. Int J Gen Syst. 2017;45(3):201–224.
   Google Scholar
• Burgin M, Adamatzky A. Structural machines as a mathematical model of biological and chemical computers. Theory Appl Math Comput Sci. 2017;7(2):1–30.
   Google Scholar
• Burgin M. Information processing by structural machines. In: Burgin M., Dodig-Crnkovic G., editors. Theoretical information studies: information in the world. New York: World Scientific; 2020. p. 323–371.
   Google Scholar
• Cutland NJ. Computability: an introduction to recursive function theory. Cambridge: Cambridge University Press; 1980.
   Google Scholar
• Burgin M. Inductively computable sets and functions. J Comput Technol Appl (JoCTA). 2016;7(1):12–22.
   Google Scholar
• Cohen DIA. Introduction to computer theory. Hoboken (NJ): John Wiley & Sons; 1991.
   Google Scholar
• Dirac PAM. Quantum electrodynamics. Dublin: Communications of the Dublin Institute for Advanced Studies; 1943.
   Google Scholar
• Feynman RP. Negative probability. In: Peat F.D., Hiley B., editors. Quantum implications: essays in honour of david bohm. London: Routledge & Kegan Paul; 1987. p. 235–248.
   Google Scholar
• Burgin M. Axiomatizing negative probability. J Adv Res Appl Math Stat. 2016;1(1):1–17.
   Google Scholar
• Realpe-Gomez J. “Negative probabilities” as relative probabilistic expressions. Condensed Matter/Statistical Mechanics; 2019.
   Google Scholar
• Rogers H. Theory of recursive functions and effective computability. Cambridge: MIT Press; 1987.
   Google Scholar
• Wegner P. Interactive foundations of computing. Theor Comput Sci. 1998;192:315–351.
   Web of Science ®Google Scholar