Hagen Huwig
Revision as of 14:06, 13 December 2018 by GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Hagen Huwig''' FILE:HagenHuwig.jpg|border|right|thumb|link=https://alumni-informatik-dortmund.de/content/hagen-huwig| Hagen Huwig <ref>...")
Hagen Huwig [1]
Hagen Huwig,
a German mathematician and computer scientist with research interests in computational complexity theory.
While Ph.D. student at University of Dortmund during the mid 70s, he led a project team to develop the chess program Proscha [2] [3], written in PL/I for the IBM 370. Proscha played the First GI Computer Chess Tournament [4] [5].
Contents
Selected Publications
1975 ...
- Hagen Huwig (1975). Bericht über eine Projektgruppe mit dem Thema Schachprogrammierung. Bericht Nr. 9, University of Dortmund (German)
- Hagen Huwig (1976). Beziehungen zwischen beschränkter syntaktischer und beschränkter primitiver Rekursion. Dissertation, University of Dortmund, advisor Volker Claus (German)
- Hagen Huwig (1976). A Machine Independent Description of Complexity Classes, Definable by Nondeterministic as well as Determinsitic Turing Machines with Primitive Pecursove Tape or Time Bounds. MFCS 1976
- Hagen Huwig, Volker Claus (1977). Das Äquivalenzproblem für spezielle Klassen von Loop-1-Pogrammen. Theoretical Computer Science 1977, Lecture Notes in Computer Science 48
1980 ...
- Hagen Huwig (1980). Das P=NP-Problem in der Kategorie der partiellen Ordnungen mit 2-stelligen Suprema. 10. GI Jahrestagung 1980
- Hagen Huwig, Axel Poigné (1980). A criterion common to various continuous completions of albegras and X-categories. CLAAP 1980
- Hagen Huwig (1981). A Definition of the P=NP-Problem in Categories. FCT 1981
- Hagen Huwig (1982). Ein Modell des P=NP -Problems mit einer positiven Lösung. Acta Informatica, Vol. 17
- Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig (1984). P-generic sets. Automata, Languages and Programming, Lecture Notes in Computer Science 172
- Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig (1987). Diagonalizing over Deterministic Polynomial Time. CSL 1987
- Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig (1987). Diagonalizations over polynomial time computable sets. Theoretical Computer Science, Vol. 51]
1990 ...
- Hagen Huwig, Axel Poigné (1990). A note on inconsistencies caused by fixpoints in a Cartesian closed category. Theoretical Computer Science, Vol. 73 [7]
External Links
- Hagen Huwig | Alumni der Informatik Dortmund e.V. (1977), Photo by Oliver Vornberger [8]
- The Mathematics Genealogy Project - Hagen Huwig
References
- ↑ Hagen Huwig | Alumni der Informatik Dortmund e.V. (1977), Photo by Oliver Vornberger, Bildgalerien | Alumni der Informatik Dortmund e.V.
- ↑ Hagen Huwig (1975). Bericht über eine Projektgruppe mit dem Thema Schachprogrammierung. Bericht Nr. 9, University of Dortmund (German)
- ↑ Hans Decker (1998). EinBlick - Ursprünge der Dortmunder Informatik. pdf
- ↑ Erstes Computer-Schachturnier der Gesellschaft für Informatik October 17, 1975, Computerwoche 42/1975 (German)
- ↑ Reinhard Zumkeller (1975). Erstes GI Computer-Schach-Turnier, Dortmund 1975, Bulletin, including a paper by Konrad Zuse
- ↑ dblp: Hagen Huwig
- ↑ Archives of the Caml mailing list > Message from Martin Berger
- ↑ Bildgalerien | Alumni der Informatik Dortmund e.V.
