MAC Memos (1963 - 1974): Recent submissions

Now showing items 28-30 of 57

    • 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 ...

    • Discrete Computation: Theory and Open Problems 

      Meyer, Albert R. (1974-01)
      Complexity 1. Borodin, A. Computational Complexity: Theory and Practice, in Currents in the Theory of Computing, A. Aho, ed., Prentice-Hall, Englewood Cliff, N.J., 1973,pp.32-89.

    • Weak Monadic Second Order Theory of Successor is not Element-recurive 

      Meyer, Albert R. (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 ...