Browsing MAC Memos (1963 - 1974) by Title

Now showing items 23-42 of 57

    • Fast On-line Integer Multiplication 

      Fischer, Michael J.; Stockmeyer, Larry J. (1974-05)
      A Turing machine multiplies binary integers on-line if it receives its inputs low-order digits first and produces the jth digit of the product before reading in the (j+l)st digits of the two inputs. We present a general ...

    • File Management and Related Topics, June 12, 1970 

      Graham, Robert M. (1970-09)
      The subject of these notes is file management. We will develop the problems of file management within the environment of a large information and computing service, often called a computer utility or general purpose ...

    • Finding Isomorph Classes for Combinatorial Structures 

      Weiss, Randell B. (1975-06)
      A common problem in combinatorial analysis is finding isomorph classes of combinatorial objects. This process is sometimes known as isomorph rejection. In graph theory, it is used to count labelled and unlabelled graphs ...

    • First Version of a Data Flow Procedure Language 

      Dennis, Jack B. (1975-05)
      A language for representing computational procedures based on the concept of data flow is presented in terms of a semantic model that permits concurrent execution of noninterfering program parts. Procedures in the language ...

    • Formal Properties of Well-formed Data Flow Schemas 

      Leung, Clement Kin Cho (1975-06)
      This thesis presents some results in comparative schematology and some undecidability results for two models of computer programs: the class of flowchart schemas and the class of well-formed data flow schemas (wfdfs's). ...

    • Helping People Think 

      Goldstein, Robert C. (1971-04)
      Everyone, today, is familiar with the use of machines to ease physical burdens. Since the dawn of civilization, man's progress in gaining control over his environment has been largely determined by the power and sophistication ...

    • Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees 

      Bayer, Paul J. (1975-11)
      A binary search tree can be used to store data in a computer system for retrieval by name. Different elements in the tree may be referenced with different probabilities. If we define the cost of the tree as the average ...

    • An Improved Overlap Argument for On-line Multiplication 

      Paterson, Michael S.; Fischer, Michael J.; Meyer, Albert R. (1974-01)
      A lower bound of cN1ogN is proved for the mean time complexity of an on-line multitape Turing machine performing the multiplication of N-digit binary integers. For a more general class of machines the corresponding bound ...

    • The Inherent Computational Complexity of Theories of Ordered Sets: A Brief Survery 

      Meyer, Albert R. (1974-10)

    • Interactive Design Coordination for the Building Industry 

      Jackson, James N. (1970-06)
      The problem of effective communication in the process of building design and construction is widely recognized. The involvement of several design disciplines combined with the tendency for designers to work in distinct ...

    • An Interactive Implementation of the ToddCoxeter Algorithm 

      Bonneau, Richard J. (1973-12)
      The Todd-Coxeter algorithm provides a systematic approach to the enumeration of cosets of a finitely presented group. This memo describes an interactive implementation of algorithm, including a manual on its use, examples, ...

    • An Investigation of Current Language Support for the Data Requirements of Structured Programming 

      Aiello, Jack M. (1974-09)
      Structured programming is a new method for constructing reliable programs. Structured programming relies upon a systematic technique of top-down development which involves the refinement of both control structures and data ...

    • The Macaims Data Management System 

      Goldstein, Robert C.; Strnad, Alois J. (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 

      Bengelloun, Safwan A. (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 

      Fenichel, Robert R. (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 

      Levin, Michael (1975-02)

    • On the Complexity of the Theories of Weak Direct Products 

      Rackoff, Charles (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 

      Moll, Robert (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, ...

    • Polynomial Exponentiation: The Fast Fourier Transform Revisited 

      Bonneau, Richard J. (1973-06)

    • Pseudo-random Sequences 

      Bruere-Dawson, Gerard (1970-10)
      The purpose of this paper is to study some notions of randomnes for infinite sequences of 0's and 1's.