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 (1981). A Definition of the P=NP-Problem in Categories. FCT 1981
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 [1] [2], written in PL/I for the IBM 370. Proscha played the First GI Computer Chess Tournament [3] [4].
Table of Contents
Selected Publications
[6]External Links
References
What links here?
Up one Level