LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 316-318 of 486

    • The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals 

      Mayr, Ernst W.; Meyer, Albert R. (1981-06)
      Any decision procedure for the word problems for commutative semigroups and polynomial ideals inherently requires computational storage space growing exponentially with the size of the problem instrance to which the procedure ...

    • The Propositional Dynamic Logic of Deterministic, Well-Structured Programs 

      Halpern, Joseph Y.; Reif, John H. (1981-03)
      We consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dynamic Logic (SDPDL), which is appropriate for reasoning about deterministic well-structured programs. In contrast to PDL, for which ...

    • Conservative Logic 

      Fredkin, Edward; Toffoli, Tommaso (1981-05)
      Conservative logic is a comprehensive model of computation which explicitly reflects a number of fundamental principles of physics, such as the reversibility of the dynamical laws and the conservation of certain additive ...