Now showing items 1-20 of 1754

• #### 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 ...
• #### CUPL - An Approach to Introductory Computing Instruction ﻿

(Cornell University, 1968-01)
CUPL is a second-generation 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 ﻿

(Cornell University, 1968-01)
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 Real-Time Information Retrieval ﻿

(Cornell University, 1968-02)
Future operating document retrieval systems may be based on fully-automatic information analysis methods instead of manual indexing, and on real-time search procedures which allow the user to interact with the system during ...
• #### 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 ...
• #### Automated Language Processing ﻿

(Cornell University, 1968-02)
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 ﻿

(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 ...
• #### The Structure of SNOBOL4 ﻿

(Cornell University, 1968-02)
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 ﻿

(Cornell University, 1968-03)
The effectiveness of conventional document indexing is compared with that achievable by fully-automatic 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 ﻿

(Cornell University, 1968-03)
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 ﻿

(Cornell University, 1968-03)
Translation Networks and Function Composition
• #### DPL: A Language for Instruction in Concepts Basic to Data Processing and Management Information Systems ﻿

(Cornell University, 1968-04)
DPL: A Language for Instruction in Concepts Basic to Data Processing and Management Information Systems
• #### Concepts and Structures in Programming Languages ﻿

(Cornell University, 1968-04)
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 ﻿

(Cornell University, 1968-04)
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 ﻿

(Cornell University, 1968-05)
A recursive relation is developed for the determinant of a pentadiagonal matrix $S$ which satisfies $s_{i,j} \neq 0$ for $|i-j|=1$. When $S$ is symmetric, one has a six-term recursive relation. An example is given to ...
• #### Two Memory Bounds for the Recognition of Primes by Automata ﻿

(Cornell University, 1968-06)
Two Memory Bounds for the Recognition of Primes by Automata
• #### On Newton-Like Iteration Functions: General Convergence Theorems and a Specific Algorithm ﻿

(Cornell University, 1968-06)
On Newton-Like Iteration Functions: General Convergence Theorems and a Specific Algorithm
• #### On the Equivalence and Containment Problems for Context-Free Languages ﻿

(Cornell University, 1968-06)
• #### A Quadratically Convergent Newton-Like Method Based Upon Gaussian-Elimination ﻿

(Cornell University, 1968-08)
A Quadratically Convergent Newton-Like Method Based Upon Gaussian-Elimination