Project MAC: Recent submissions

Now showing items 34-36 of 176

    • Productivity in Parallel Computational Schemata 

      Linderman, John P. (1973-12)
      A general model for parallel computation is developed in three parts. One part, the data flow graph, describes how actors which transform and test values are connected to the locations in a finite memory. Another part, ...

    • Complexity Classes of Recursive Functions 

      Moll, Robert (1973-06)
      An honest function is one whose size honestly reflects its computation time. In 1969 Meyer and McCreight proved the "honesty theorem," which says that for every t, the t-computable functions are the same as the t'computable ...

    • The Emptiness and Complementation Problems for Automata on Infinite Trees 

      Rackoff, Charles Weill (1973-01)
      In [6] Rabin defines Automata on Infinite Trees, and the body of that paper is concerned with proving two theorems about these automata. The result we consider in the first chapter says that there exists an effective ...