Search Constraints

Start Over
Filtering by: Subject Turing machines Remove constraint Subject: Turing machines Peer Reviewed No Remove constraint Peer Reviewed: No

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

  • Some computational schemes equivalent to Turing machines

    Creator:
    Anderson, Sandra Elaine
    Abstract:
    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.
    Resource Type:
    Masters Thesis
    Full Text:
    MACHINES Abstract approve ajor professor) Computational scheme, equivalence, and Turing machine are

  • A Turing automaton simulator program

    Creator:
    Kolbet, James Theodore
    Abstract:
    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...
    Resource Type:
    Masters Thesis
    Full Text:
    approved: Redacted for Privacy Harry E. Goheen A description of a Turing Machine simulator, programmed on