Simple Computation-Universal Cellular Spaces
暂无分享,去创建一个
[1] E. F. Codd,et al. Cellular automata , 1968 .
[2] Alvy Ray Smith. General Shift-Register Sequences of Arbitrary Cycle Length , 1971, IEEE Transactions on Computers.
[3] Alvy Ray Smith,et al. Cellular Automata Complexity Trade-Offs , 1971, Inf. Control..
[4] William L. Kilmer. On Dynamic Switching in One-Dimensional Iterative Logic Networks , 1963, Inf. Control..
[5] Claude E. Shannon,et al. A Universal Turing Machine with Two Internal States , 1956 .
[6] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[7] D. C. Cooper,et al. Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.
[8] John von Neumann,et al. Theory Of Self Reproducing Automata , 1967 .
[9] Alvy Ray Smith,et al. Cellular automata theory , 1969 .
[10] Chester Lee,et al. SYNTHESIS OF A CELLULAR COMPUTER , 1968 .
[11] Marvin Minsky,et al. Computation : finite and infinite machines , 2016 .
[12] Journal of the Association for Computing Machinery , 1961, Nature.
[13] W. R. Stahl. Self-Reproducing Automata , 2015, Perspectives in biology and medicine.
[14] Michael A. Arbib,et al. Simple Self-Reproducing Universal Automata , 1966, Inf. Control..
[15] Alvy Ray Smith,et al. Simple Computation-Universal Cellular Spaces and Self-Reproduction , 1968, SWAT.