Browsing MAC Memos (1963 - 1974) by Title
Now showing items 49-57 of 57
-
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 ...