Abstract
Algorithmic undecidability of the problem of determining computational complexity of models describing various ecosystems has been proved from a formal language theory point of view
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Silvert, W: "Complexity"; J. Biol. Systems 4 (1996), 585–591.
Lovasz, L. and Gacs, P.: "Complexity of algorithms"; Lecture Notes (1999), (http://research.microsoft.com/users/lovasz/complex.ps).
Amann, R.I., Ludwig, W. and Schleifer, K.-H.: "Phylogenic identification and in situ detection of individual microbial cells without cultivation"; Microbiol. Rev. 59 (1995), 143–169.
Meyers, S.P.: "Developments in aquatic microbiology"; Internatl. Microbiol. 3 (2000), 203–211.
Carrillo, H. and Lipman, D.J.: "The multiple sequence alignment problem in biology"; SIAM J. Appl. Math. 48 (1988), 1073–1082.
Ginsburg, S.: "The mathematical theory of context-free languages"; McGraw-hill Book Company, Inc./ New York (1966).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer
About this paper
Cite this paper
Naidenko, V., Bouriako, I., Proth, JM. (2005). Computational Complexity of Modeling Ecosystems. In: Levner, E., Linkov, I., Proth, JM. (eds) Strategic Management of Marine Ecosystems. NATO Science Series IV: Earth and Environmental Series, vol 50. Springer, Dordrecht. https://doi.org/10.1007/1-4020-3198-X_10
Download citation
DOI: https://doi.org/10.1007/1-4020-3198-X_10
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-3157-1
Online ISBN: 978-1-4020-3198-4
eBook Packages: Earth and Environmental ScienceEarth and Environmental Science (R0)