Content deleted Content added
Stevebroshar (talk | contribs) →Alternatives to bit string: This is about rendering ... which is different than representation or encoding |
Stevebroshar (talk | contribs) it's broader and looser than a just machine code and bytecode |
||
| (5 intermediate revisions by the same user not shown) | |||
Line 3:
[[Image:Wikipedia in binary.gif|thumb |The ASCII-encoded letters of "Wikipedia" represented as binary codes.]]
[[Image:Binary to Hexadecimal or Decimal.jpg|thumb |Values represented in binary, hex and decimal]]
A '''binary code''' is the value of a [[data encoding |data-encoding]] convention represented in a [[Binary number |binary]] notation that usually is a sequence of 0s and 1s; sometimes called a ''[[bit]] string''. For example, [[ASCII]] is an 8-bit text encoding that in addition to the [[human readable]] form (letters) can be represented as binary. ''Binary code'' can also refer to the [[mass noun]] ''code''
Even though all modern computer data is binary in nature, and therefore, can be represented as binary, other [[numerical base]]s are usually used. [[Power of 2]] bases (including [[hexadecimal |hex]] and [[octal]]) are sometimes considered binary code since their power-of-2 nature makes them inherently linked to binary. [[Decimal]] is, of course, a commonly used representation. For example, ASCII characters are often represented as either decimal or hex. Some types of data such as [[image]] data is sometimes represented as hex, but rarely as decimal.
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 34 ⟶ 43:
; Bagua {{anchor|BaGua}}: The ''[[bagua]]'' is a set of diagrams used in ''[[feng shui]],'' [[Taoist]] [[cosmology]] and ''[[I Ching]]'' studies. The ''ba gua'' consists of 8 trigrams; each a combination of three lines (''yáo'') that are either broken ([[Yin and yang|''yin'']]) or unbroken (''yang'').<ref name='wilhelm'>{{cite book |last=Wilhelm |first=Richard |author-link=Richard Wilhelm (sinologist) |others=trans. by [[Cary F. Baynes]], foreword by [[C. G. Jung]], preface to 3rd ed. by [[Hellmut Wilhelm]] (1967) |title=The I Ching or Book of Changes |publisher=Princeton University Press |year=1950 |___location=Princeton, NJ |url=https://books.google.com/books?id=bbU9AAAAIAAJ&pg=PA266 |isbn=978-0-691-09750-3 |pages=266, 269}}</ref>
; Ifá
==
[[File:2D Binary Index.svg|thumb|An example of a recursive [[binary space partitioning]] [[quadtree]] for a 2D index]]
Innumerable encoding systems exists. Some notable examples are described here.
; ASCII: The [[American Standard Code for Information Interchange]] (ASCII) character encoding, is a 7-bit convention for representing (normal/printing) characters and [[Control character |control]] operations. Each printing and control character is assigned a number from 0 to 127. For example, "a" is represented by decimal code 97 which is rendered as bit string <code>1100001</code>.
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==
* {{Annotated link |Binary file}}
* {{Annotated link |Bit array}}
* {{Annotated link |Constant-weight code}}
* {{Annotated link |Gray code}}
* {{Annotated link |List of binary codes}}
| |||