Search
Now showing items 11-20 of 42
An AI Approach to English Morphemic Analysis
(1971-02-01)
This paper illustrated an approach toward understanding natural language through the techniques of artificial intelligence. It explores the structure of English word-endings both morpho-graphemically and semantically. It ...
Twenty Things To Do With A Computer
(1971-06-01)
When people talk about computers in education they do not all have the same image in mind. Some think of using the computer to program the kid; others think of using the kid to program the computer. But most of them have ...
DDT Reference Manual
(1971-09-01)
This memo describes the version of DDT used as the command level of the A.I. Laboratory Time Sharing System (ITS). Besides the usual program control, examination, and modification features, this DDT provides many ...
Information Theory and the Game of JOTTO
(1971-08-01)
The word game, JOTTO, has attracted the interest of several computer programmers over the years, not to mention countless devoted players. Rules are: 1.) Each of 2 players selects a 5-letter English word, or a proper noun, ...
The Computer as a Performing Instrument
(1971-02-01)
This memo was originally presented as a Project MAC seminar on February 20, 1970. From the outset, the computer has established two potential roles in the musical arts--the one as a sound synthesizer and the other as a ...
An Inquiry into Algorithmic Complexity
(1971-09-01)
This is the first section in a proposed monograph on algorithmic complexity theory. Future sections shall include: information Theory as a Proof Technique; Algorithms Using Linear Form Inequalities; Some Probabilistic ...
Instant TJ6. How to Get the System to Type Your Papers
(1971-09-01)
TJ6 is a program that takes disk files of text and arranges them so that they can be printed out neatly on 8 1/2 by 11 paper, lines justified, pages numbered, and so on. So that TJ6 will know what to do you must insert ...
Theories, Pre-Theories and Finite State Transformations on Trees
(1971-05-01)
The closure of an algebra is defined as a generalization of the semigroup of a finite automation. Pretheories are defined as a subclass of the closed algebras, and the relationship between pretheories and the algebraic ...
Computer Proofs of Limit Theorems
(1971-06-01)
In this paper we describe some relatively simple changes that have been made to an existing automatic theorem proving program to enable it to prove efficiently a number of the limit theorems of elementary calculus. These ...
Linking Loader for MIDAS
(1971-03-01)
This memo was originally printed as MAC Memo 268, January 31, 1966. The MIDAS Linking Loader is a PDP-6program to load re-locatable format output from the MIDAS assembler, with facilities to handle symbolic cross-reference ...