複雑性
314-317
↑ Debnath, N.C. and Burgin, M., (2003) Software Metrics from the Algorithmic Perspective, in Proceedings of the ISCA 18th International Conference “Computers and their Applications”, Honolulu, Hawaii, pp. 279-282
↑ Johnson, Neil F. (2007). Two’s Company, Three is Complexity: A simple guide to the science of all sciences. Oxford: Oneworld. ISBN 978-1-85168-488-5
↑ Lissack, Michael R.; Johan Roos (2000). The Next Common Sense, The e-Manager’s Guide to Mastering Complexity. Intercultural Press. ISBN 9781857882353
Fundamentals of the Theory of Computation, Morgan Kauffman Publishers, San Francisco, 1998
1 2 Mark Burgin (2005), Super-recursive algorithms, Monographs in computer science, Springer.
↑ Blum, M. (1967) On the Size of Machines, Information and Control, v. 11, pp. 257-265
↑ Burgin, M. (1982) Generalized Kolmogorov complexity and duality in theory of computations, Notices of the Russian Academy of Sciences, v.25, No. 3, pp.19-23
↑ Burgin, M. and Debnath, N. Hardship of Program Utilization and User-Friendly Software, in Proceedings of the International Conference “Computer Applications in Industry and Engineering”, Las Vegas, Nevada, 2003, pp.
↑ Weaver, Warren (1948), “Science and Complexity”, American Scientist 36: 536 (Retrieved on 2007–11–21.), http://www.ceptualinstitute.com/genre/weaver/weaver-1947b.htm
↑ Johnson, Steven (2001). Emergence: the connected lives of ants, brains, cities, and software. New York: Scribner. pp. p.46. ISBN 0-684-86875-X
↑ Lloyd, Seth (2006). Programming the Universe. Knopf. ISBN 978-1400033867
↑ Jacobs, Jane (1961). The Death and Life of Great American Cities. New York: Random House
↑ Ulanowicz, Robert, "Ecology, the Ascendant Perspective", Columbia, 1997
↑ Greenlaw, N. and Hoover, H.J.