Search
Now showing items 1-10 of 29
PDP-6 LISP
(1966-06-01)
This is a mosaic description of PDP-6 LISP, intended for readers familiar with the LISP 1.5 Programmer's Manual or who have used LISP on some other computer. Some of the newer features (e.g. the display) are experimental ...
Figure Boundary Description Routings for the PDP-6sVision Project
(1966-09-01)
As a step in the direction of "computer vision," several programs have been written which transform the output of a vidisector into some mathematical descriptions of the boundaries enclosing the objects in the field of ...
A New Version of CTSS LISP
(1966-02-01)
A new version of the CTSS LISP is now available. The new system provides additional data storage and several new functions and constants. The I/O capabilities, EXCISE, the error comments, and several routines have ...
A New Machine-Learning Technique Applied to the Game of Checkers
(1966-03-01)
This paper described a recent refinement of the machine--learning process employed by Samuel (1) in connection with his development of a checker playing program. Samuels checker player operates in much the same way a ...
POLYBRICK: Adventures in the Domain of Parallelepipeds
(1966-05-01)
A collection of programs tries to recognize, which one more successfully than its predecessor, 3-dimensional parallelepipeds (solids limited by 6 planes, parallel two-by-two), using as data 2-dimensional idealized projections. ...
A Program Feature for CONVERT
(1966-04-01)
A program feature has been constructed for CONVERT, closely modeled after the similar facility found in many versions of LISP. Since it is functional or operational in nature, it has been included as a skeleton form, ...
Symbolic Integration
(1966-06-01)
A program has been written which is capable of integrating all but two of the problems solved by the Siagle's symbollic integration program SAINT. In contrast to SAINT, it is a purely algorithmic program and it has ...
Summer Vision Programs
(1966-10-01)
We assume that we are given a square array that describes a scene. The name of the array will be "array." The number of points representing the side length of the array will be called "pts." (I.e., (pts)2 is the total ...
The Summer Vision Project
(1966-07-01)
The summer vision project is an attempt to use our summer workers effectively in the construction of a significant part of a visual system. The particular task was chosen partly because it can be segmented into sub-problems ...
Symbolic Integration II
(1966-10-01)
In this memo we describe the current state of the integration program originally described in AI Memo 97 (MAC-M-310). Familiarity with Memo 97 is assumed. Some of the algorithms described in that memo have been extended. ...