Skip to main content

An algorithm-theoretic method in studying homogeneous random networks

Part I

Part of the Lecture Notes in Mathematics book series (LNM,volume 653)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Toom A.L. Non-ergodic multi-dimensional automata systems. Problemy Peredači Informacii, 10, (1974), vyp. 3, 70–79.

    MathSciNet  MATH  Google Scholar 

  2. Vasershtein L.N., Markov processes on a conutable space product describing large automata systems, Problemy Peredači Informacii, 5, (1969), vyp. 3, 64–72.

    MathSciNet  Google Scholar 

  3. Plesnevich G.S., Comparison of two consepts of computing on homogeneous iterative automata. The Conference on Automata Theory and Artificial Intellect, Tashkent, Abstracts of Communications, Computing Center of the USSR Academy of Sciences, Moscow, 1968 (Russ,).

    Google Scholar 

  4. Stockmeyer L. The complexity of decision problems in automata theory and logic, Project MAC MIT, 1974.

    Google Scholar 

  5. Chomsky N., Miller G.A., Finite state languages, Information and Control, 1, (1958), 91–112.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Martin-Löf P. Notes on constructive mathematics, Almquist & Weksell, Stockholm, 1970.

    MATH  Google Scholar 

  7. De Leeuw K., Moore E.F., Shannon C.E., Shapiro N., Computing on stochastic Turing machines, in: Automata Studies, C.E. Shannon and J. McCarthy eds., Princeton, New Jersey, Princeton University Press, 1956.

    Google Scholar 

  8. Kleene S.C. A representation of events in nerve networks and finite automata, In: Automata Studies, C.E. Shannon and J. McCartheds, eds., Princeton, New Jersey, Princeton University Press, 1956.

    Google Scholar 

  9. Freivald R.V., Limit computations on stochastic machines, Uchonye Zapiski Latviiskogo Gosudarstvennogo Universiteta, 210, (1974), no I (Russ.).

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Kurdyumov, G.L. (1978). An algorithm-theoretic method in studying homogeneous random networks. In: Dobrushin, R.L., Kryukov, V.I., Toom, A.L. (eds) Locally Interacting Systems and Their Application in Biology. Lecture Notes in Mathematics, vol 653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070083

Download citation

  • DOI: https://doi.org/10.1007/BFb0070083

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08450-1

  • Online ISBN: 978-3-540-37044-4

  • eBook Packages: Springer Book Archive