Universal computing systems. Part 1, Simulation of any Normal Algorithm by Turing machine. Part 2, A universal Turing machine to translate any Turing machine to a Normal Algorithm

Graduate Thesis Or Dissertation

Public Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/fn1071475

Descriptions

Attribute Name	Values
Creator	Nelson, Thomas Clayton
Abstract	In this paper a direct, constructive proof of the equivalence of the Normal Algorithm and Turing machine using the Turing machines NAS (Normal Algorithm Simulator) and NAC (Normal Algorithm Converter) is presented. The Turing machine NAS can simulate any particular Normal Algorithm, and NAG can convert the quintuples of a given Turing machine to an equivalent Normal Algorithm.
Resource Type	Dissertation
Date Available	2010-07-27T15:57:50+00:00
Date Issued	1969-06-10
Degree Level	Doctoral
Degree Name	Doctor of Philosophy (Ph.D.)
Degree Field	Mathematics
Degree Grantor	Oregon State University
Commencement Year	1970
Advisor	Goheen, Harry E.
Academic Affiliation	Mathematics
Non-Academic Affiliation	Oregon State University. Graduate School
Subject	Algorithms
Rights Statement	Copyright Not Evaluated
Publisher	Oregon State University
Language	English [eng]
Digitization Specifications	File scanned at 300 ppi (Monochrome) using Capture Perfect 3.0.82 on a Canon DR-9080C in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces	http://hdl.handle.net/1957/17119

Parents:

This work has no parents.

In Collection:

Thumbnail	Title	Date Uploaded	Visibility	Actions
	NelsonThomasClayton1970.pdf	2017-08-07	Public	Download