Advertisement

Relations between models of parallel abstract machines

  • Michel Cosnard
  • Pascal Koiran
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 678)

Abstract

We formally introduced a new model of computations the RealRAM and its parallel counterpart the RealPRAM. We study the relationship between these models, classical computational models and two recently proposed parallel machine models, the real machine from Blum, Shub and Smale and the analog neural networks from Siegelman and Sontag. We propose a classification using simulations by dynamical systems. We also generalise the NC class and P-complete problems to real computations.

Keywords

Cellular Automaton Turing Machine Parallel Random Access Machine Analog Neural Network Local Transition Function 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J.L. Balcázar, J. Diáz, and J. Gabarró. Structural Complexity I. EATCS monographs on theoretical computer science. Springer-Verlag, 1988.Google Scholar
  2. [2]
    L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society, 21(1):1–46, July 1989.Google Scholar
  3. [3]
    M. Cosnard and A. Ferreira. On the real power of loosely coupled parallel architectures. Parallel Processing Letters, 1(2):103–112, 1991.Google Scholar
  4. [4]
    M. Cosnard, M. Garson, and P. Koiran. Computability properties of low-dimensional systems. In Proceedings of STACS'9S, Lecture notes in computer science to appear. Springer Verlag, 1993.Google Scholar
  5. [5]
    F. Cucker and F. Rossello. On the complexity of some problems for the Blum, Shub and Smale model. In Proceedings of Latin'92, Lecture notes in computer science, pages 530–545. Springer Verlag, 1992.Google Scholar
  6. [6]
    R.M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. Handbook of Theoretical Computer Science, Vol. A Algorithms and complexity, pages 870–941, 1990.Google Scholar
  7. [7]
    P. Koiran. On the relations between dynamical systems and boolean circuits. Research Report in preparation, LIP, Ecole Normale Supérieure de Lyon, 1992.Google Scholar
  8. [8]
    B. Martin. A universal parallel random-access machine based on cellular automata. Research Report, LIP, Ecole Normale Supérieure de Lyon, 1992.Google Scholar
  9. [9]
    F.P. Preparata and Shamos M.I. Computational Geometry. Springer, 1985.Google Scholar
  10. [10]
    H. T. Siegelman and E. D. Sontag. Neural networks with real weights: analog computational complexity. COLT92 and SYCON Report 92-05, Rutgers University, September 1992.Google Scholar
  11. [11]
    H. T. Siegelman and E. D. Sontag. On the computational power of neural nets. In Proc. Fifth ACM Workshop on Computational Learning Theory, July 1992.Google Scholar
  12. [12]
    P. van Emde Boas. Machine models and simulations. Handbook of Theoretical Computer Science, Vol. A Algorithms and complexity, pages 3–66, 1990.Google Scholar
  13. [13]
    F.F. Yao. Computational geometry. Handbook of Theoretical Computer Science, Vol. A Algorithms and complexity, pages 345–389, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Michel Cosnard
    • 1
  • Pascal Koiran
    • 1
  1. 1.Ecole Normale Supérieure de LyonLyonFrance

Personalised recommendations