Author:
Isokawa Teijiro,Peper Ferdinand,Mitsui Masahiko,Liu Jian-Qin,Morita Kenichi,Umeo Hiroshi,Kamiura Naotake,Matsui Nobuyuki
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Turing, A.: On computable numbers, with an application to the entscheidungsproblem. Proc. London Math. Soc. 2(42), 230–265 (1936)
2. Church, A.: An unsolvable problem of elementary number theory. American Journal of Mathematics 58(2), 345–363 (1936)
3. Neumann, J.V.: Theory of Self-Reproducing Automata. University of Illinois Press, Champaign (1966)
4. Banks, E.: Universality in cellular automata. In: IEEE 11th Ann. Symp. on Switching and Automata Theory, pp. 194–215 (1970)
5. Codd, E.F.: Cellular Automata. Academic Press, Inc., Orlando (1968)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Computation and Pattern Formation by Swarm Networks with Brownian Motion;Reversibility and Universality;2018
2. Communication Requirements for Team Automata;Lecture Notes in Computer Science;2017
3. Conditions for Compatibility of Components;Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques;2016
4. Swarm Networks in Brownian Environments;New Generation Computing;2015-07