This thesis documents a method of proving that Turing machines
work for every case, if the construction of the Turing machine is
known. Mathematical Induction is used to construct the proof that the
Turing machine for binary addition will work in every well-formed case
of the input that it receives....
Computational scheme, equivalence, and Turing machine are
defined. Some computational schemes are examined and shown to
be equivalent to the computational scheme of a Turing machine.
A description of a Turing Machine simulator, programmed on
the CDC 3300 Digital Computer, using the COMPASS programming
languages Version 2.0 of the 0S3 system. The simulator will build a
quintuple list from the input of a Turing Machine, then execute the
machine as dictated by the data to be...