In a chapter 14 titled "Very Simple Bases for Computability", Minsky (1967) presents a very readable (and exampled) subsection 14.6 The Problem of "Tag" and Monogenic Canonical Systems (pp. 267–273) (this sub-section is indexed as "tag system"). Minsky relates his frustrating experiences with the general problem: "Post found this (00, 1101) problem "intractable," and so did I, even with the help of a computer." He comments that an "effective way to decide, for any string S, whether this process will ever repeat when started with S" is unknown although a few specific cases have been proven unsolvable. In particular he mentions Cocke's Theorem and Corollary 1964. Minsky, Marvin L. (1967). Computation: Finite and Infinite Machines. Englewood Cliffs, N.J.: Prentice–Hall. pp. 267–273. ISBN978-0131655638. LCCN67-12342.
In a chapter 14 titled "Very Simple Bases for Computability", Minsky (1967) presents a very readable (and exampled) subsection 14.6 The Problem of "Tag" and Monogenic Canonical Systems (pp. 267–273) (this sub-section is indexed as "tag system"). Minsky relates his frustrating experiences with the general problem: "Post found this (00, 1101) problem "intractable," and so did I, even with the help of a computer." He comments that an "effective way to decide, for any string S, whether this process will ever repeat when started with S" is unknown although a few specific cases have been proven unsolvable. In particular he mentions Cocke's Theorem and Corollary 1964. Minsky, Marvin L. (1967). Computation: Finite and Infinite Machines. Englewood Cliffs, N.J.: Prentice–Hall. pp. 267–273. ISBN978-0131655638. LCCN67-12342.
