Content deleted Content added
Stevebroshar (talk | contribs) Replace off topic section with see-also link |
Stevebroshar (talk | contribs) Organize history info together |
||
Line 24:
=== Boolean Logical System ===
[[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>
===Timeline===
* 1875: [[Émile Baudot]] "Addition of binary strings in his ciphering system," which, eventually, led to the ASCII of today.▼
* 1884: The [[Linotype machine]] where the matrices are sorted to their corresponding channels after use by a binary-coded slide rail.▼
* 1932: [[C. E. Wynn-Williams]] "Scale of Two" counter<ref name="Glaser">{{Harvnb|Glaser|1971}}</ref>▼
* 1937: [[Alan Turing]] electro-mechanical binary multiplier▼
* 1937: [[George Stibitz]] [[Excess three code|"excess three" code]] in the [[George Stibitz#Computer|Complex Computer]]<ref name="Glaser"/>▼
* 1937: [[Atanasoff–Berry Computer]]<ref name="Glaser"/>▼
* 1938: [[Konrad Zuse]] [[Z1 (computer)|Z1]]▼
==Rendering==
Line 46 ⟶ 55:
BCD arithmetic is sometimes preferred to floating-point numeric formats in commercial and financial applications where the complex rounding behaviors of floating-point numbers is inappropriate.<ref name="Cowlishaw_GDA">{{cite web |first=Mike F. |last=Cowlishaw |author-link=Mike F. Cowlishaw |title=General Decimal Arithmetic |orig-year=1981, 2008 |publisher=IBM |date=2015 |url=http://speleotrove.com/decimal/<!-- http://www2.hursley.ibm.com/decimal/ --> |access-date=2016-01-02}}</ref>
▲* 1875: [[Émile Baudot]] "Addition of binary strings in his ciphering system," which, eventually, led to the ASCII of today.
▲* 1884: The [[Linotype machine]] where the matrices are sorted to their corresponding channels after use by a binary-coded slide rail.
▲* 1932: [[C. E. Wynn-Williams]] "Scale of Two" counter<ref name="Glaser">{{Harvnb|Glaser|1971}}</ref>
▲* 1937: [[Alan Turing]] electro-mechanical binary multiplier
▲* 1937: [[George Stibitz]] [[Excess three code|"excess three" code]] in the [[George Stibitz#Computer|Complex Computer]]<ref name="Glaser"/>
▲* 1937: [[Atanasoff–Berry Computer]]<ref name="Glaser"/>
▲* 1938: [[Konrad Zuse]] [[Z1 (computer)|Z1]]
==See also==
| |||