Now showing items 1-20 of 332

(1947)
• #### The Cornell 300-Mev Synchrotron ﻿

(Office of Naval Research, 1953-07)
This document is a companion piece to the Book: "The Legacy of Dale R. Corson". It is a report written by Dale R. Corson and others in 1953 concerning the construction of the Cornell University Nuclear Synchrotron.
• #### Education & Agriculture: A History of the New York State College of Agriculture at Cornell University ﻿

(Cornell University Press, 1963)
The College of Agriculture at Cornell University reveals through this history its contributions of nearly a century of continuous service.
• #### Computational Complexity of One-Tape Turing Machine Computations ﻿

(Cornell University, 1968-01)
This paper is concerned with the quantitative aspects of one-tape Turing machine computations. It is shown, for instance, that there exists a sharp time bound which must be reached for the recognition of non-regular sets ...
• #### On the Recognition of Primes by Automata ﻿

(Cornell University, 1968-02)
A study of the problem of recognizing the set of primes by automata is presented. A simple algebraic condition is derived which shows that neither the set of primes nor any infinite subset of primes can be accepted by a ...
• #### Tape Reversal Bounded Turing Machine Computations ﻿

(Cornell University, 1968-02)
This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. This measure yields a rich hierarchy of tape ...
• #### Two Memory Bounds for the Recognition of Primes by Automata ﻿

(Cornell University, 1968-06)
Two Memory Bounds for the Recognition of Primes by Automata
• #### Refinement of Hierarchies of Time Bounded Computations ﻿

(Cornell University, 1968-06)
It is shown that for any "slowly growing" time function $T(n)$ and any $\epsilon > 0$ there exists a computation which can be performed by a multitape Turing machine in time $T(n)\log^{\epsilon}T(n)$ and cannot be performed ...
• #### A Note on One-way and Two-way Automata ﻿

(Cornell University, 1969-09)
The purpose of this note is to show that there exist non-regular languages whose memory requirements for recognition by one-way and two-way automata differ by a double exponential and that this difference cannot be exceeded.
• #### The Use of Lists in the Study of Undecidable Problems in Automata Theory ﻿

(Cornell University, 1970-01)
NO ABSTRACT SUPPLIED
• #### An Overview of the Theory of Computational Complexity ﻿

(Cornell University, 1970-04)
The purpose of this paper is to outline the theory of computational complexity which has emerged as a comprehensive theory during the last decade. This theory is concerned with the quantitative aspects of computations and ...
• #### Computational Complexity of Random Access Stored Program Machines ﻿

(Cornell University, 1970-08)
In this paper we explore the computational complexity measure defined by running times of programs on random access stored program machines, RASP'S. The purpose of this work is to study more realistic complexity measures ...
• #### Size Arguments in the Study of Computation Speeds ﻿

(Cornell University, 1970-08)
In this paper we use arguments about the size of the computed functions to investigate the computation speed of Turing machines. It turns out that the size arguments yield several new results which we have not been able ...
• #### The Milk of Paradise: The Effect of Opium Visions on the Works of DeQuincey, Crabbe, Francis Thompson, and Coleridge ﻿

(Octagon Books, 1971)
Four eminent English authors were addicted to opium. Each author spent a considerable part of his life in a dream world which differs amazingly from that in which we live. Each author utilized the imagery from these dreams ...
• #### Final Report on NSF Research Grant Automata and Computational Complexity 1968-1972 ﻿

(Cornell University, 1972-08)
This report summarizes the results obtained in research supported by the National Science Foundation Grant AUTOMATA AND COMPUTATIONAL COMPLEXITY. The report lists the problem areas considered, the publications resulting ...
• #### The LBA Problem and its Importance in the Theory of Computing ﻿

(Cornell University, 1973-05)
In this paper we study the classic problem of determining whether the deterministic and non-deterministic context-sensitive languages are the same or, equivalently, whether the languages accepted by deterministic and ...
• #### On the Problem of Finding Natural Computational Complexity Measures ﻿

(Cornell University, 1973-06)
To develop an abstract theory which deals with the quantitative aspects of computing we need a deeper understanding of how to define "natural" computational complexity measures axiomatically. To this end, this paper ...
• #### On Simple Goedel Numberings and Translations ﻿

(Cornell University, 1973-07)
In this paper we consider Goedel numberings (viewed as simple models for programming languages) into which all other Goedel numberings can be translated very easily. Several such classes of Goedel numberings are defined ...
• #### Simulation and model verification of agricultural tractor overturns ﻿

(Thesis (Ph. D.) - Cornell University, 1973-08)
• #### Computational Complexity of Formal Translations ﻿

(Cornell University, 1973-12)
The purpose of this paper is to define a mathematical model for the study of quantitative problems about translations between universal languages and to investigate such problems. The results derived in this paper deal ...