Advertisement

Grzegorz Rozenberg: A Magical Scientist and Brother

  • Arto SalomaaEmail author
Chapter
Part of the Natural Computing Series book series (NCS)

Abstract

This is a personal description of Grzegorz Rozenberg. There is something magical in the fact that one man, Grzegorz, has been able to obtain so many and such good results in so numerous and diverse areas of science. This is why I have called him a “magical scientist.” He is also a very interdisciplinary scientist. In some sense this is due to his educational background. His first degree was in electronics engineering, the second a master’s in computer science, and the third a Ph.D. in mathematics. However, in the case of Grzegorz, the main drive for new disciplines comes from his tireless search for new challenges in basic science, rather than following known tracks. Starting with fundamental automata and language theory, he soon extended his realm to biologically motivated developmental languages, and further to concurrency, Petri nets, and graph grammars. During the past decade, his main focus has been on natural computing, a term coined by Grzegorz himself to mean either computing taking place in nature or human-designed computing inspired by nature.

Keywords

Graph Grammar Natural Computing Personal Description Computer Science Technical Report Magical Scientist 
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.
    Brauer W et al. (1992) Grzegorz: many happy returns. EATCS Bull 46:391–413 Google Scholar
  2. 2.
    Kari L, Rozenberg G, Salomaa A (1997) L systems. In: Rozenberg G, Salomaa A (eds) Handbook of formal languages, vol 1. Springer, Berlin Google Scholar
  3. 3.
    Nielsen M, Rozenberg G, Salomaa A, Skyum S (1974) Nonterminals, homomorphisms and codings in different variations of OL-systems, part I. Acta Inform 3:357–364 zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Nielsen M, Rozenberg G, Salomaa A, Skyum S (1974) Nonterminals, homomorphisms and codings in different variations of OL-systems, part II. Acta Inform 4:87–106 zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Păun G, Rozenberg G, Salomaa A (1998) DNA computing. New computing paradigms. Springer, Berlin zbMATHGoogle Scholar
  6. 6.
    Rozenberg G (1967) Decision problems for quasi-uniform events. Bull Acad Pol Sci XV:745–752 Google Scholar
  7. 7.
    Rozenberg G (1999) The magic of theory and the theory of magic. In: Calude C (ed) People and ideas in theoretical computer science. Springer, Singapore, pp 227–252 Google Scholar
  8. 8.
    Rozenberg G, Salomaa A (1980) The mathematical theory of L systems. Academic Press, New York zbMATHGoogle Scholar
  9. 9.
    Rozenberg G, Salomaa A (1986) The book of L. Springer, Berlin zbMATHGoogle Scholar
  10. 10.
    Rozenberg G, Salomaa A (1994) Cornerstones of undecidability. Prentice Hall, New York zbMATHGoogle Scholar
  11. 11.
    Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages, vols 1–3. Springer, Berlin Google Scholar
  12. 12.
    Rozenberg G, Salomaa A (eds) (1996) Watson–Crick complementarity, universal computations and genetic engineering. Leiden University, Department of Computer Science Technical Report 96–28 Google Scholar
  13. 13.
    Rozenberg G, Salomaa A (1999) DNA computing: new ideas and paradigms. In: Wiedermann J, van Emde P (eds) Automata, languages and programming, ICALP’99 proceedings. Springer lecture notes in computer science, vol 1644. Springer, Berlin, pp 106–118 CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Turku Centre for Computer ScienceTurkuFinland

Personalised recommendations