Search
Now showing items 1-10 of 13
Natural Language Input for a Computer Problem Solving System
(1964-03-01)
This paper describes a computer program which accepts and "understands" a comfortable, but restricted set of one natural language, English. Certain difficulties are inherent in this problem of making a machine "understand" ...
New Language Storage Conventions
(1964-05-01)
These conventions are for the implementation of the new language on a large computer on which time-sharing is the standard role of operation. Each user is at any time asigned a certain amount of primary storage. This ...
Syntax of the New Language
(1964-05-01)
This is a definition of the syntax of the *** language. It consists of modifications and extensions of the "Revised Report on the Algorithmic Language ALGOL 60" which is printed in the "Communications of the ACM", January ...
REVISED USER'S VERSION - Time Sharing LISP
(1964-04-01)
This memo describes changes to the LISP system by several people. The changes reduce printout and give the user more control over it. They also make it possible for LISP to communicate with the teletype and the disk. The ...
The Graphical Typewriter: A Versatile Remote Console Idea
(1964-01-01)
It would be useful to develop a combination typewriter-plotter along the lines described below. The device could be coupled to a telephone line with a reasonably small amount of electronics -- mostly relays.
LISP Exercises
(1964-01-01)
The following exercises are carefully graded to mesh with the sections in Chapter I, "The LISP Language", in the LISP 1.5 Programmer's Manual. Each exercise should be worked immediately after reading the manual section indicated.
String Manipulation in the New Language
(1964-07-01)
String manipulation can be made convenient within the *** language by implementing two functions: 1) match [workspace; pattern] and 2) construct {format;pmatch]. In this memo I describe how I think these two functions can ...
Hash-Coding Functions of a Complex Variable
(1964-06-25)
A common operation in non-numerical analysis is the comparison of symbolic mathematical expressions. Often equivalence under the algebraic and trigonometric relations can be determined with the high probability by hash-coding ...
CTSS LISP Notice-Supplement to A.I. Memo No. 67
(1964-12-01)
The LISP system (command version) has been updated. Bugs are corrected include: 1. out of pushdown list in compiled function will not transfer to 77777. 2. with compiler printing turned off by comprint, it is truly off. ...
Unrecognizable Sets of Numbers
(1964-11-01)
When is a set A of positive integers, represented as binary numbers, "regular" in the sense that it is a set of sequences that can be recognized by a finite-state machine? Let pie A(n) be the number of members of A less ...