FAMOUS  COMPUTER  SCIENTISTS

John Von Neumann
ALAN TURING
1903 - 1957

CONTRIBUTION

  1.         In 1928, I published a paper titled “On the Theory of Games of Strategy” containing proof for the Minimax Theorem which showed that “for any zero-sum two-person game in a normalized form ... [there exists a unique numerical value representing a gain for one player and a loss for the other” (Kuhn 101). This proof is regarded as the first mathematical formalization of the field and it has wide-ranging implications in computer science.


  2.     I  was the inventor, in 1945, of the merge sort algorithm, in which the  first and second halves of an array are each sorted recursively and then merged.


  1. Reference Link
  2. Reference Link