Browsing MAC Memos (1963 - 1974) by Title
Now showing items 35-54 of 57
-
The Macaims Data Management System
(1971-04)MacAIMS (MAC Advanced Interactive Management System) is a relatively small research project that was initiated in the summer of 1968 to investigate the feasibility of using some of the then existing computer facilities at ... -
MDC-Programmer: A Muddle-to-datalanguage Translator for Information Retrieval
(1974-10)This memo describes a practical application within the framework of the ARPA computer network of the philosophy that a fully developed computer network should appear as a virtual extensino of the user's own software ... -
A New List-tracing Algorithm
(1970-10)List-processing systems have each allowed use of only a single size and configuration of list cell. This paper describes a system which allows use of arbitrarily many different sizes and configurations of list cell, ... -
On Bateson's Logical Levels of Learning Theory
(1975-02) -
On the Complexity of the Theories of Weak Direct Products
(1974-01)Let N be the set of nonnegative integers and let < N ,+> be the weak direct product of < N,+> with itself. Mostowski[ 9 ] shows that the theory of < N ,*> is decidable, but his decision procedure isn't elementary recursive. ... -
An Operator Embedding Theorem for Complexity Classes of Recursive Functions
(1973-05)Let F (t) be the set of functions computable by some machine using no more than t(x) machine steps on all but finitely many arguments x. If we order the - classes under set inclusion as t varies over the recursive functions, ... -
Pseudo-random Sequences
(1970-10)The purpose of this paper is to study some notions of randomnes for infinite sequences of 0's and 1's. -
Real-time Simulation of Multidimensional Turing Machines by Storage Modification Machines
(1973-12)In [1] the author introduced a new machine model, now called the Storage Modification Machine (SMM). It was claimed, but not proved, that SMM's can simulate all sorts of Turing machines-- those with multidimensional worktapes ... -
The Reduction Method for Establishing Lower Bounds on the Number of Additions
(1974-06)A method for establishing lower bounds on the number of multiplications and divisions has been developed by Pan, Winograd and Strassen. A similar method is developed for establishing lower bounds on the number of additions ... -
The Relational Approach to the Management of Data Bases
(1971-04)The ultimate goal of Project MacAIMS (MAC Advanced Interactive Management System) is to build a computer facility which will be able to support non-trivial decision making processes. (See reference 4). In the early stages ... -
Research on Experts Systems
(1974-12) -
SIM360: A S/360 Simulator
(1972-05)Modern, large-scale computer systems typically operate under the control of an operating system or executive program, and reserve for the exclusive use of the operating system a set of privileged instructions, which the ... -
Steam-oriented Computation in Recursive Data Flow Schemas
(1975-10)In this thesis we present a parallel programming language based on a parallel computation model known as data flow schemas. Syntactically, the language resembles programming languages such as Algol 60, but does not have ... -
String-matching and Other Products
(1974-01)The string-matching problem considered here is to find all occurrences of a given pattern as a substring of another longer string. When the pattern is simply a given string of symbols, there is an algorithm due to Morris, ... -
Super-exponential Complexity of Presburger Arithmetic
(1974-02)Lower bounds are established on the computational complexity of the decision problem and on the inherent lengths of proofs for two classical decidable theories of logic: the first order theory of the real numbers under ... -
Symmetry Codes and Their Invariant Subcodes
(1974-02)We define and study the invariant subcodes of the symmetry codes in order to be able to determine the algebraic properties of these codes. An infinite family of self-orthogonal rate 1/2 codes over GF (3), called symmetry ...