Search Constraints

Start Over
Filtering by: Subject Turing machines Remove constraint Subject: Turing machines Creator Henry, Calvin Oscar Leon Remove constraint Creator: Henry, Calvin Oscar Leon

Search Results

  • Computation by a Turing machine carried out in a Minsky post tag formalism

    Creator:
    Henry, Calvin Oscar Leon
    Abstract:
    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....
    Resource Type:
    Masters Thesis
    Full Text:
    : COMPUTATION BY A TURING MACHINE CARRIED OUT IN MINSKY POST TAG FORMALISM Abstract Approved: Redacted for