JavaScript is disabled for your browser. Some features of this site may not work without it.
Use of eCommons for rapid dissemination of COVID19 research
In order to maximize the discoverability of COVID19 research, and to conform with repository best practices and the requirements of publishers and research funders, we provide special guidance for COVID19 submissions.
Browsing Computer Science by Issue Date
Now showing items 120 of 1754

Computational Complexity of OneTape Turing Machine Computations
Hartmanis, Juris (Cornell University, 196801)This paper is concerned with the quantitative aspects of onetape Turing machine computations. It is shown, for instance, that there exists a sharp time bound which must be reached for the recognition of nonregular sets ... 
CUPL  An Approach to Introductory Computing Instruction
Conway, Richard W.; Maxwell, W. L. (Cornell University, 196801)CUPL is a secondgeneration language and processor designed specifically for introductory instruction in computer programming. It combines a severely simple syntax (based loosely on PL/I) and very extensive tutorial and ... 
Automatic Content Analysis in Information Retrieval
Salton, Gerard (Cornell University, 196801)The content analysis problem is first introduced, and some of the standard analysis procedures used in information retrieval are reviewed. The principal content analysis methods incorporated into the automatic SMART document ... 
Search and Retrieval Experiments in RealTime Information Retrieval
Salton, Gerard (Cornell University, 196802)Future operating document retrieval systems may be based on fullyautomatic information analysis methods instead of manual indexing, and on realtime search procedures which allow the user to interact with the system during ... 
On the Recognition of Primes by Automata
Hartmanis, Juris; Shank, H. (Cornell University, 196802)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 ... 
Automated Language Processing
Salton, Gerard (Cornell University, 196802)This study covers recent developments in automatic text processing, including syntactic, semantic, and statistical language analysis methods. The emphasis is on applications in the areas of machine translation, information ... 
Tape Reversal Bounded Turing Machine Computations
Hartmanis, Juris (Cornell University, 196802)This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a twotape Turing machine with a oneway input tape. This measure yields a rich hierarchy of tape ... 
The Structure of SNOBOL4
Wegner, Peter (Cornell University, 196802)The SNOBOL4 programming language was developed by Griswold, Poage and Polonski (1). It combines facilities available in problem oriented languages with string manipulation facilities, pattern matching facilities and ... 
A Comparison Between Manual and Automatic Indexing Methods
Salton, Gerard (Cornell University, 196803)The effectiveness of conventional document indexing is compared with that achievable by fullyautomatic text processing methods. Evaluation results are given for a comparison between the MEDLARS search system used at the ... 
The Use of Standardized Documentary Data in AutomaticInformation Dissemination
Salton, Gerard (Cornell University, 196803)It is likely that future operating information retrieval systems may be based on automatic information analysis methods instead of manual indexing, and on search procedures which allow the user to interact with the system ... 
Translation Networks and Function Composition
Wegner, Peter (Cornell University, 196803)Translation Networks and Function Composition 
DPL: A Language for Instruction in Concepts Basic to Data Processing and Management Information Systems
Morgan, Howard L. (Cornell University, 196804)DPL: A Language for Instruction in Concepts Basic to Data Processing and Management Information Systems 
Concepts and Structures in Programming Languages
Wegner, Peter (Cornell University, 196804)These notes develop a set of concepts for describing program structures which arise in programming languages. These concepts are then used to discuss FORTRAN, ALGOL, macro languages, languages with definitional facilities, ... 
The Representation and Transformation of Functions
Wegner, Peter (Cornell University, 196804)A new approach to the study of programming languages is developed, which emphasized the sequence of information structures generated by a program during its execution. In section 1 a class of models called information ... 
A Recursive Relation for the Determinant of a Pentadiagonal Matrix
Sweet, Roland A. (Cornell University, 196805)A recursive relation is developed for the determinant of a pentadiagonal matrix $S$ which satisfies $s_{i,j} \neq 0$ for $ij=1$. When $S$ is symmetric, one has a sixterm recursive relation. An example is given to ... 
Two Memory Bounds for the Recognition of Primes by Automata
Hartmanis, Juris; Shank, H. (Cornell University, 196806)Two Memory Bounds for the Recognition of Primes by Automata 
On NewtonLike Iteration Functions: General Convergence Theorems and a Specific Algorithm
Brown, Kenneth M.; Dennis, John E., Jr. (Cornell University, 196806)On NewtonLike Iteration Functions: General Convergence Theorems and a Specific Algorithm 
On the Equivalence and Containment Problems for ContextFree Languages
Hopcroft, John E. (Cornell University, 196806)Let $G$ and $G_{0}$ be contextfree grammars. Necessary and sufficient conditions on $G_{0}$ are obtained for the decidability of $L(G_{0}) \subseteq L(G)$. It is also shown that it is undecidable for which $G_{0},L(G) ... 
Refinement of Hierarchies of Time Bounded Computations
Hartmanis, Juris; Hopcroft, John E. (Cornell University, 196806)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 Quadratically Convergent NewtonLike Method Based Upon GaussianElimination
Brown, Kenneth M. (Cornell University, 196808)A Quadratically Convergent NewtonLike Method Based Upon GaussianElimination