Index Catalog // ScholarsArchive@OSU

The property of completeness of geometry

Creator:: Chow, Chi-Ming
Abstract:: This thesis presents an analytic proof of the property of completeness for two and three dimensional Euclidean geometries.
Resource Type:: Masters Thesis

The mechanization of logic II

Creator:: Witcraft, Don A.
Resource Type:: Masters Thesis

The integro-geometric tangent measures of euclidean n-space

Creator:: Zelver, Jack Solomon
Abstract:: A technique of differentiation with respect to the distance to the boundary of an outer parallel-body is applied to known measures of sets of p-dimensional linear spaces which intersect a general convex body in n-dimensional euclidean space in order to obtain an appropriate definition of the measures of sets of...
Resource Type:: Dissertation

The foundations of trigonometry

Creator:: Borden, Susan Jane (Dobson)
Resource Type:: Masters Thesis

The enumeration of strings of a given length in an n-ary non-associative non-commutative algebra

Creator:: Klosinski, Leonard Frank
Abstract:: In his book on abstract algebra, Nathan Jacobson poses and solves the problem of finding the number of ways of inserting parentheses in a string of given length with binary operators. We continue the work of Jacobson and go beyond it in that we no longer consider one binary operator...
Resource Type:: Masters Thesis

Stability of numerical integration of ordinary differential equations

Creator:: Lathrop, James Frank
Abstract:: The thesis discusses stability of procedures based on linear computing formulas for numerical integration of an ordinary first-order differential equation. The theorems are proved: (1) If the procedure is asymptotically stable it is stable for small positive step size if the Lipschitz number is negative; (2) Relative stability always exists...
Resource Type:: Masters Thesis

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

On triangulations of fixed points in the plane

Creator:: Weingarten, Frederick Wesley
Abstract:: A theory of straight line triangulations of points in the plane is developed. A basic transformation is presented, and it is shown that any triangulation may be transformed into any other triangulation which has the same boundary by a finite sequence of the basic transformations. The proof of the transformation...
Resource Type:: Dissertation

On the algebra of orthogonal Latin squares

Creator:: Goebel, Jack Bruce
Resource Type:: Dissertation

Mechanization of the Moore-Mealy algorithm for the reduction of sequential machines

Creator:: Marsh, Donald Dean
Resource Type:: Masters Thesis

Machine algorithms for Boolean matrices

Creator:: Comstock, Dale R.
Resource Type:: Masters Thesis

First order differential corrections in the eigenvalue problem

Creator:: Akers, David Warren
Abstract:: Let A be an n x n real, symmetric matrix with distinct characteristic values λ₁, λ₂,...,λɴ. Then there exists an orthogonal matrix P such that PAPᵀ = Λ = (λi). Given a small symmetric change, ∆A, in the matrix A, we can calculate the resulting changes, ∆P, and ∆Λ, in...
Resource Type:: Masters Thesis

Finite non-projective geometries without the axiom of parallels

Creator:: Henderson, Mason Edward
Resource Type:: Masters Thesis

Finite geometries without the axiom of parallels

Creator:: Henderson, Mason Edward
Abstract:: Among the geometries with n points on every line (with n an integer greater than one), those in which there are no parallels and those in which the axiom of parallels holds have been discussed (as finite projective and affine geometries) in the literature. This paper contrasts such geometries with...
Resource Type:: Dissertation

Elements of a fast decimal arithmetic unit

Creator:: Unger, Izaak Leo
Abstract:: A systematic and rigorous derivation of the Boolean functions that represent the three operations of the ring of integers in the 1-2-4-5 code is developed from their corresponding tables. The same is done for numerical complementation of a number. The equations of the latter are combined with those for addition...
Resource Type:: Dissertation

Constructive methods for finding a root of certain algebraic equations with real coefficients

Creator:: Keizur, James Jay
Abstract:: A new procedure is developed for computing a root of algebraic equations with real coefficients and a degree n, where n is 2, 4, 6, 10, 14 or any positive odd integer. A heuristic procedure is added to partially lift the restrictions on the degree n. The procedures are written...
Resource Type:: Masters Thesis

Computer simulation of college administration

Creator:: Boles, John Amos
Abstract:: Since the advent of the modern computer there has been great interest in simulation of all types. It is not possible to simulate very large systems on computers. This thesis presents the algorithms necessary to simulate a college with respect to the academic relationship of the student with the college....
Resource Type:: Masters Thesis

Circuit algebras and some of their properties

Creator:: Driessel, Kenneth Richard
Abstract:: It is well known that two-terminal switching circuits may be represented by boolean formulas. Thus the study of certain switching circuit problems leads to the study of free boolean algebras, in particular to the free boolean algebra on a countably infinite set of generators. An abstract characterization of this algebra...
Resource Type:: Masters Thesis

Algorithms for the solution of two algebraic equations in two unknowns

Creator:: Holroyd, John Ries
Abstract:: The author develops a new recursive procedure for the evaluation of Sylvester's eliminant. The algorithm is written in the ALGOL 60 language.
Resource Type:: Masters Thesis

A Turing machine programming language

Creator:: Margolis, Susan Paula
Abstract:: This thesis documents a new language which facilitates the construction of Turing machines. The language translator is written in Compass and has been debugged and is available for use on the CDC 3300.
Resource Type:: Masters Thesis

ScholarsArchive@OSU

The property of completeness of geometry

The mechanization of logic II

The integro-geometric tangent measures of euclidean n-space

The foundations of trigonometry

The enumeration of strings of a given length in an n-ary non-associative non-commutative algebra

Stability of numerical integration of ordinary differential equations

Some computational schemes equivalent to Turing machines

On triangulations of fixed points in the plane

On the algebra of orthogonal Latin squares

Mechanization of the Moore-Mealy algorithm for the reduction of sequential machines

Machine algorithms for Boolean matrices

First order differential corrections in the eigenvalue problem

Finite non-projective geometries without the axiom of parallels

Finite geometries without the axiom of parallels

Elements of a fast decimal arithmetic unit

Constructive methods for finding a root of certain algebraic equations with real coefficients

Computer simulation of college administration

Circuit algebras and some of their properties

Algorithms for the solution of two algebraic equations in two unknowns

A Turing machine programming language

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