Skip to Content

Switch language English
- Switch language
- Deutsch
- English
- Español
- Français
- Italiano
- Português do Brasil
- 中文
Login

ScholarsArchive@OSU

Home
About
Help
Contact

Search ScholarsArchive@OSU

Advanced Search

Search Constraints

Start Over

Filtering by: Subject Turing machines Remove constraint Subject: Turing machines Academic Affiliation Mathematics Remove constraint Academic Affiliation: Mathematics

1 - 5 of 5

Relevance
Title [A-Z]
Title [Z-A]
Date Created ▼
Date Created ▲
Date Uploaded ▼
Date Uploaded ▲

Number of results to display per page

10 per page
20 per page
50 per page
100 per page

View results as:

List Gallery Masonry

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
An operator scheme for computation with Turing machines

Creator:

Comstock, Dale Robert

Abstract:

An operator scheme for composition of Turing machines is developed and applied to the computation of the recursive functions over an arbitrary alphabet.

Resource Type:

Dissertation
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
Solutions of restricted cases of the halting problem applied to the determination of particular values of a non-computable function

Creator:

Brady, Allen Harold

Abstract:

See pdf.

Resource Type:

Dissertation

Limit your search

Academic Affiliation

Mathematics[remove]5

Advisor

Goheen, Harry2
Goheen, Harry E.2
Goheen, H.1

Commencement Year

Commencement Year range begin – Commencement Year range end

Current results range from 1964 to 1975

View distribution

Creator

Anderson, Sandra Elaine1
Brady, Allen Harold1
Comstock, Dale Robert1
Henry, Calvin Oscar Leon1
Kolbet, James Theodore1

Date

Date range begin – Date range end

Current results range from 1963 to 1973

View distribution

Decade

1970-19792
1960-19693

Degree Field

Mathematics5

Degree Level

Master's3
Doctoral2

Degree Name

Master of Science (M.S.)3
Doctor of Philosophy (Ph.D.)2

Language

English [eng]5

Non-Academic Affiliation

Oregon State University. Graduate School5

Peer Reviewed

No3

Resource Type

Masters Thesis3
Dissertation2

Rights Statement

Copyright Not Evaluated5

Subject

Turing machines4
Algorithms1
Recursive functions1
Turing machines -- Computer programs1

Scholars Archive is a service of Oregon State University Libraries & Press

121 The Valley Library
Corvallis, OR 97331-4501

Contact Us
Services for Persons with Disabilities

Powered by Hyrax 3.6.0

Copyright © 2018 Oregon State University
Licensed under the Apache License, Version 2.0

Core Trust application (pdf)