Browsing MAC Memos (1963 - 1974) by Title
Now showing items 43-57 of 57
-
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 ... -
Use of High Level Languages for Sytems Programming
(1970-09)(This paper is a slightly edited version of a transcript so that it still contains the colloquial flavor of the oral presentation.) I'm going to talk about languages for systems programming what they can do for us, and ... -
A User's Guide to the Macro Control Language
(1973-12) -
Weak Monadic Second Order Theory of Successor is not Element-recurive
(1973-12)Let L SIS be the set of formulas expressible in a week monadic second order logic using only the predicates [x =y+1] and [x E z]. Bucci and Elgot [3,4] have shown that the truth of sentences in L SIS (under the standard ...