A mathematical model of parallel information processing

  • A. Skowron
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)


Cellular Automaton Parallel Program Infinite Sequence Memory State Parallel Composition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Codd E., Cellular automata, New York, 1968.Google Scholar
  2. [2]
    Kahn G., The semantics of a simple language for parallel programming, IFIP 1974, pp. 471–475.Google Scholar
  3. [3]
    Muraszkiewicz M., Nonnumerical algorithms information processing and methods of their realizations in matrix functional units, [in Polish], Ph. D. thesis, Warsaw 1976.Google Scholar
  4. [4]
    Peterson J.L., Bredt T.H., A comparison of models of parallel computation, IFIP 1974, pp. 466–470.Google Scholar
  5. [5]
    Salwicki A., Formalized algorithmic logic, Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys., 18 (1970), 227–231.Google Scholar
  6. [6]
    Skowron A., The theory of parallel programs /to appear/.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • A. Skowron
    • 1
  1. 1.Institute of MathematicsWarsaw UniversityPoland

Personalised recommendations