 Smith first constructed a sequence of rule systems showing that the (2,3) Turing machine is capable of arbitrary finite computations.He then employed a novel approach to extend that construction to unbounded computations.The proof proceeds in two stages.