3 Great Insights Of Computer Science:

- Gottfried Wilhelm Leibniz’s, George Boole’s, Alan Turing’s, Claude Shannon’s, and Samuel Morse’s insight:
All the information about any computable problem can be represented using only 0 and 1 (or any other bistable pair that can flip-flop between two easily distinguishable states, such as “on/off”, “magnetized/de-magnetized”, “high-voltage/low-voltage”, etc.).
2. Alan Turing’s insight:
There are only five actions that a computer has to perform in order to do “anything”. Every algorithm can be expressed in a language for a computer consisting of only five basic instructions:
- move left one location;
- move right one location;
- read symbol at current location;
- print 0 at current location;
- print 1 at current location.
3. Corrado Böhm and Giuseppe Jacopini’s insight:
There are only three ways of combining these actions (into more complex ones) that are needed in order for a computer to do “anything”.
- sequence: first do this, then do that;
- selection: IF such-and-such is the case, THEN do this, ELSE do that;
- repetition: WHILE such-and-such is the case DO this.
Thanks for reading this article I hope its helpful to you all ! Keep up the learning, and if you would like more computer science, programming and algorithm analysis videos please visit and subscribe to my YouTube channels (randerson112358 & compsci112358 )
Check Out the following for content / videos on Computer Science, Algorithm Analysis, Programming and Logic:
YouTube Channel:
randerson112358: https://www.youtube.com/channel/UCaV_0qp2NZd319K4_K8Z5SQ
compsci112358:
https://www.youtube.com/channel/UCbmb5IoBtHZTpYZCDBOC1CA
Website:
http://everythingcomputerscience.com/
Video Tutorials on Recurrence Relation:
https://www.udemy.com/recurrence-relation-made-easy/
Video Tutorial on Algorithm Analysis:
https://www.udemy.com/algorithm-analysis/
Twitter:
https://twitter.com/CsEverything
YouTube Channel:

Computer Science Website:

Udemy Videos on Algortithm Analysis:
