Universal Counter Machine—Turing Machine
- 1.2k Downloads
Paul Chapman’s universal counter machine described in Chap. 3 is universal because it can simulate an arbitrary counter machine. It has been shown by Minsky that a counter machine can also simulate an arbitrary Turing machine. This chapter describes such a machine implemented by the author in Conway’s Game of Life and compares this with Paul Chapman’s machine. It is based on the Paul Chapman’s machine and the design from Minsky. The full universal counter machine program is listed in Appendix B.