Index Catalog // ScholarsArchive@OSU

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

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...
Resource Type:: Dissertation
Full Text:: algorithm to compute a function f if and only if f is Turing computable. These two forms of Church's

Study of effective algorithms for solving polynomial algebraic equations in one unknown

Creator:: Noonchester, Howard Basil
Abstract:: This paper makes available practical algorithms and their associated FORTRAN IV computer programs for finding the roots of polynomial equations. The purpose of this paper is to examine effective algorithms for solving polynomial algebraic equations in one unknown on a digital computer. The advent of high - speed digital computing...
Resource Type:: Masters Thesis
Full Text:: be the 2 values of the roots to within these tolerances. We examine six algorithms which are

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

Smooth approximations and quermassintegrals

Creator:: Ojha, Murari Prasad
Abstract:: See pdf.
Resource Type:: Dissertation

Recognition of printed Chinese characters

Creator:: Lok, Pat Jiun-chang
Abstract:: This method of character recognition is according to the topological features of a.given character. First store the image of a Chinese character into the storage of the computer. Each image of the character appears as a 20 x 20 binary matrix. Each small square in the matrix is designated as...
Resource Type:: Masters Thesis
Full Text:: ) Preprocessor: This process includes three operations. These are Cleaning, Thinning and Connecting. (B

On the simplification of Boolean polynomials

Creator:: Dixon, Oren Wesley
Resource Type:: Masters Thesis
Full Text:: or 2. 2) The 51th coordinate of P is O if y is V t s. 3. With these m coordinates

On the calculations of the coefficients of cyclotomic polynomials

Creator:: Paik, Young Hyun
Resource Type:: Masters Thesis
Full Text:: shows that these factors can be grouped into distinct sets, each set being Qd(x) for some integer d

On systems of Boolean equations

Creator:: Toms, Ralph Marvin
Resource Type:: Masters Thesis
Full Text:: independ ent variables are present. And since these conditions de pend upon the coefficients of the

On scheduling algorithms

Creator:: Balogh, Mária Edith Csermelyi
Abstract:: General techniques for constructing Scheduling Algorithms are described as well as their applications to two diverse problems, namely the scheduling at a university and the imitation of the activity of a taxonomist in microbiology.
Resource Type:: Dissertation

On numerical solutions of the general Navier-Stokes equations for two-layered stratified flows

Creator:: Hwang, John Dzen
Abstract:: The objective of this paper is to seek the general solution of the complete Navier-Stokes equations governing heterogeneous, time-dependent, incompressible, viscous, laminar fluid dynamics through digital simulation. In particular, two-layered stratified flows are treated by using a numerical algorithm called the Marker-and-Cell extended method (MACE), which is an extension of...
Resource Type:: Dissertation

ScholarsArchive@OSU

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

Study of effective algorithms for solving polynomial algebraic equations in one unknown

Solutions of restricted cases of the halting problem applied to the determination of particular values of a non-computable function

Smooth approximations and quermassintegrals

Recognition of printed Chinese characters

On the simplification of Boolean polynomials

On the calculations of the coefficients of cyclotomic polynomials

On systems of Boolean equations

On scheduling algorithms

On numerical solutions of the general Navier-Stokes equations for two-layered stratified flows

Limit your search

Academic Affiliation

Advisor

Commencement Year

Creator

Date

Decade

Degree Field

Degree Level

Degree Name

Language

Non-Academic Affiliation

Peer Reviewed

Resource Type

Rights Statement

Subject

Search Constraints

Search Results

Limit your search