Heinz Kaphengst

from Wikipedia, the free encyclopedia

Heinz Kaphengst (* 1932 ) is a German computer scientist .

Life

Heinz Kaphengst holds a doctorate in maths (Dr. rer. Nat.). At the Technical University of Dresden he became an assistant at the "Institute for Computer Technology" founded in 1956, which was headed by Nikolaus Joachim Lehmann . Later he was a scientist at Robotron .

Heinz Kaphengst took an important step in the mathematical modeling of real, technical computers, which the Turing machine only simulates very far from reality. In 1954, Hans Hermes succeeded in proving that concrete calculating machines are just as powerful as Turing machines. In 1959, Heinz Kaphengst published the article “An abstract program-controlled computing machine” (Volume 5, pp. 366–379) in the “Journal for mathematical logic and foundations of mathematics”, which provided direct evidence of the universality of digital computers. Building on this, John C. Shepherdson and Howard E. Sturgis (independently according to their own statements) created the register machine model , which in their article from 1963 goes into detail on the work of Kaphengst. A proof of the Turing universality of common digital calculating machines was first published by Hans Hermes in 1954. Kaphengst's work emerged from discussions with Günter Asser .

At Robotron, together with Horst Reichel and others, he developed the theoretical basics of computer science.

Fonts

  • An abstract program-controlled calculating machine , in: Journal for mathematical logic and foundations of mathematics, Volume 5, 1959, pp. 366–379
  • Description of contact circuits through equivalences on the node set , Journal for mathematical logic and foundations of mathematics, Volume 10, 1964, pp. 147-150
  • Malzew spaces, a general term for recursive mapping , in: Journal for mathematical logic and foundations of mathematics, Volume 15, 1969, pp. 63-76
  • with Horst Reichel: EPS - a language for the design of complex program systems , VEB Kombinat Robotron , Dresden, 1975
  • with Horst Reichel: Algebraic Algorithm Theory , VEB Kombinat Robotron 1971
  • with Horst Reichel: Language description and language processing in the context of algebraic algorithm theory , VEB Kombinat Robotron 1971
  • with Ulrich Hupbach, Horst Reichel: Initial algebraic specification of data types, parameterized data types and algorithms , VEB Kombinat Robotron, Center for Research and Technology, Dresden 1980
  • For the construction of a multi-varietal elementary logic , magazine f. Mathem. Logic and Fundamentals of Mathematics, Volume 31, 1985, 39-56

literature

  • Computability of Recursive Functions , by John C. Shepherdson and Howard E. Sturgis, Journal of the ACM, Volume 10, 1963, 217-255
  • Historical notes on computer science , by Friedrich L. Bauer , Springer Verlag 2009

Individual evidence

  1. ↑ for example Hartmut Ehrig, Footprints of HR in initial algebra and final coalgebra, TU Berlin, 2005 (festival colloquium on the 65th birthday of Horst Reichel), pdf .
  2. ↑ Computability of Recursive Functions, John C. Shepherdson and Howard E. Sturgis, J. Assoc. Computing Machinery, Volume 10, 1963, p. 219
  3. ↑ Hermes, The Universality of Program-Controlled Calculators, Math.-Phys. Semester reports, Volume 4, 1954, pp. 42–53
personal data
SURNAME Kaphengst, Heinz
BRIEF DESCRIPTION German computer scientist
DATE OF BIRTH 1932