This prover of the minimax theorem devised a scheme where data and instruction use the same memory and lines.
This mathematician showed that a locally compact Hasudorff group with a finite dimensional representation can be given a Lie group structure. He created a method where getting a zero is defined as getting heads then tails to simulate an unbiased coin using a biased one. He defined a structure that is an identity containing strongly closed sub C star algebra of bounded operators on a Hilbert space. This man proved that in a two player, zero sum game there exists what would later be called a Nash equilibrium solution. This prover of the minimax theorem devised a scheme where data and instruction use the same memory and lines. For 10 points, name this Hungarian member of the Manhattan project and the namesake of a computer architecture.
This mathematician showed that a locally compact Hasudorff group with a finite dimensional representation can be given a Lie group structure.
John von Neumann