Günter Hotz

from Wikipedia, the free encyclopedia

Günter Hotz (born November 16, 1931 in Rommelhausen ) is a pioneer in German computer science . Among other things, he wrote standard works on formal languages , circuit theory and complexity theory .

biography

Hotz graduated from secondary school in Friedberg (Hessen) in 1952 . He then studied mathematics and physics in Frankfurt am Main and Göttingen . In 1956 he graduated with a diploma in mathematics. In 1958 he was at Kurt Reidemeister with the theme "About two node representations" doctorate . From 1958 to 1962 he worked as a development engineer at Telefunken . In 1962 he received a habilitation grant from the Fritz Thyssen Foundation. He accepted an invitation to the Institute for Applied Mathematics at Saarland University, where he completed his habilitation in 1965. After a brief teaching activity in Tübingen , he became a full professor of computer science at the Saarland University in Saarbrücken in 1969 . Although he received offers from other universities, he stayed at this chair until his retirement in 2000. The Saarbrücken students have honored this several times with torchlight procession.

Hotz played a major role in establishing the subject of computer science as an independent science between mathematics and electrical engineering. He was a founding member and first chairman of the Society for Computer Science and contributed to the establishment of two special research areas of the German Research Foundation : "Electronic Language Research" and "VLSI Design Methods and Parallelism".

Since 2001, the "Friends of Saarbrücken Computer Science Association" has awarded the Günter Hotz Medal to the three most successful computer science graduates every year.

Günter Hotz has been married since 1958 and has five daughters and eleven grandchildren. He has lived in St. Ingbert since 1972 .

Honors

Honorary doctorate from universities

Honorary professorship

Publications (excerpt)

  • Automata Theory and Formal Languages (1969/70, several new versions)
  • Homomorphisms and Reductions of Linear Languages (1970)
  • Computer science: computer systems, Teubner study book (1972)
  • Circuit theory , De Gruyter (1974)
  • Complexity as a Criterion in Theory Formation (1988)
  • Algorithms, Languages ​​and Complexity (1990)
  • Introduction to Computer Science, Guides and Monographs of Computer Science , B. G. Teubner, (1990)
  • Algorithmic Information Theory (1997)

Web links

Individual evidence

  1. member entry by Günter Hotz at the Academy of Sciences and Literature Mainz , accessed on 11.10.17
  2. http://www-hotz.cs.uni-sb.de/~hotz/curriculum_vitae.html
  3. http://www.cs.uni-saarland.de/index.php?id=408
  4. ^ Announcement of awards of the Saarland Order of Merit . In: Head of the State Chancellery (Ed.): Official Gazette of the Saarland . No. 35 . Saarbrücker Zeitung Verlag und Druckerei GmbH, Saarbrücken July 13, 1989, p. 995 ( uni-saarland.de [PDF; 206 kB ; accessed on June 2, 2017]).