3 ms·
Turing - On Computable Numbers, with an Application to the Entscheidungsproblem - 1937 Shannon - A Mathematical Theory of Communication - 1948 Shannon calcula
by TheOtherHobbes 8y ago
Turing - On Computable Numbers, with an Application to the Entscheidungsproblem - 1937
Shannon - A Mathematical Theory of Communication - 1948
Shannon calculated the entropy of arbitrary symbol systems over noisy communication channels, and made some first steps towards practical data compression algorithms.
Turning formalised the concept of computability using an abstraction of a mechanised logic system.
I'd say Turing wins easily - we still say logical systems are Turing Complete rather than Shannon Compatible.
- mbrock 8y agoDon’t forget Shannon’s 1937 master’s thesis, A Symbolic Analysis of Relay and Switching Circuits.
- yesenadam 8y agoYeah, he actually had the idea that you could use the 19th C Boolean logic and switching circuits to do mathematical operations, making modern computers possible. It's disappointing that he's not better known for this, to say the least. e.g. that anyone on here doesn't know his huge importance.