Search
Now showing items 141-150 of 166
PSEG: Standardization of Data
(1967-06-01)
PSEG is a function of one argument--a region name which comes from REGIONLIST, as created by TOPOLOGIST. When it is done, the following data structure exists. *indicates that the data was already stored correctly when PSEG ...
STRING
(1967-09-01)
This document describes the STRING programming language which has been implemented on the MAC Artificial Group's PDP-6 computer. In the STRING system, all objects--constants, variables, functions and programs--are ...
PLANNER: A Language for Proving Theorems
(1967-07-01)
The following is a description of SCHEMATISE, a proposal for a program that proves very elementary theorems though the use of planning. The method is most easily explained through an example die to Black.
Decomposition of a Visual Scene into Bodies
(1967-09-01)
This memorandum describes a program which finds bodies in a scene, presumably formed by 3-dimensional objects, with some of them perhaps not completely visible.
Linearly Unrecognizable Patterns
(1967-01-01)
The central theme of this study is the classification of certain geometrical properties according to the type of computation necessary to determine whether a given figure has them.
Description and Control of Manipulation by Computer-Controlled Arm
(1968-09-01)
The immediate purpose of the research on Intelligent Automata is to have an autonomous machine able to understand uncomplicated commands and to manipulate simple objects without human intervention. This thesis is concerned ...
Linear Separation and Learning
(1968-10-01)
This is a reprint of page proofs of Chapter 12 of Perceptrons, M. Minsky and S. Papert, MIT Press 1968, (we hope). It replaces A.I. Memo No. 156 dated March 1968. The perceptron and convergence theorems of Chapter 11 are ...
Decomposition of a Visual Scene into Three-Dimensional Bodies
(1969-01-01)
The program described here takes as its input a collection of lines, vertices and surfaces describing a scene, and analyzes the scene into a composition of three-dimensional objects. The program does not need to know the ...
Recognition of Topological Invariants by Modular Arrays
(1968-09-01)
In this paper we study recognition of topological invariant properties of patterns by use of finite, rectangular 2-dimensional, interactive arrays of finite state automata (hereafter called modular arrays). The use of ...
A Heuristic Program that Constructs Decision Trees
(1969-03-01)
Suppose there is a set of objects, {A, B,...E} and a set of tests, {T1, T2,...TN). When a test is applied to an object, the result is wither T or F. Assume the test may vary in cost and the object may vary in probability ...