Content deleted Content added
Stevebroshar (talk | contribs) →Other forms of binary code: Remove extraneous info (we don't need to describe where computing started in an article about binary codes) |
Stevebroshar (talk | contribs) →Alternatives to bit string: This is about rendering ... which is different than representation or encoding |
||
Line 25:
[[George Boole]] published a paper in 1847 called 'The Mathematical Analysis of Logic' that describes an algebraic system of logic, now known as [[Boolean algebra (logic)|Boolean algebra]]. Boole's system was based on binary, a yes-no, on-off approach that consisted of the three most basic operations: AND, OR, and NOT.<ref name="Boolean operations">{{Cite web|url=http://www.kerryr.net/pioneers/boolean.htm|title=What's So Logical About Boolean Algebra?|website=www.kerryr.net}}</ref> This system was not put into use until a graduate student from [[Massachusetts Institute of Technology]], [[Claude Shannon]], noticed that the Boolean algebra he learned was similar to an electric circuit. In 1937, Shannon wrote his master's thesis, ''[[A Symbolic Analysis of Relay and Switching Circuits]]'', which implemented his findings. Shannon's thesis became a starting point for the use of the binary code in practical applications such as computers, electric circuits, and more.<ref name="Claude Shannon">{{Cite web|url=http://www.kerryr.net/pioneers/shannon.htm|title=Claude Shannon (1916 - 2001)|website=www.kerryr.net}}</ref>
==Rendering==
{{original research|section|date=March 2015}}
[[File:Bagua-name-earlier.svg|thumb|Daoist Bagua]]
| |||