The binary (or base two) system is used in all computers and is represented by the digits 0 and 1. These correspond to the logic states the computer preforms. a 0 is a logic low and a 1 is a logic high.
2006-06-20 02:09:01
·
answer #2
·
answered by Dusty 7
·
0⤊
0⤋
Binary numbers consist of number 0 and 1, no more.
2006-06-20 01:27:04
·
answer #3
·
answered by ooowen 3
·
0⤊
0⤋
Binary numbers are made up of only 0 and 1's e.g.
Binary number = "Normal numbers" or base 10 numbers
0 = 0
1 = 1
10 = 2
11 = 3
100 = 4
101 = 5
110 =6
111 = 7
1000 = 8
1001 = 9
1010 = 10
1011 = 11
1100 = 12
1101 = 13
1110 = 14
1111 = 15
etc.
Look on google for more info if you can't see the pattern
Computers use binary numbers for all their calculations.
2006-06-20 01:20:46
·
answer #4
·
answered by Anonymous
·
0⤊
0⤋
The binary numeral system (base 2 numerals) represents numeric values using two symbols, typically 0 and 1. More specifically, binary is a positional notation with a radix of two. Owing to its relatively straightforward implementation in electronic circuitry, the binary system is used internally by virtually all modern computers.
The ancient Indian mathematician Pingala presented the first known description of a binary numeral system in the 3rd century BCE.
A full set of 8 trigrams and 64 hexagrams, analogous to the 3-bit and 6-bit binary numerals, were known to the ancient Chinese in the classic text I Ching. Similar sets of binary combinations have also been used in traditional African divination systems such as Ifá as well as in medieval Western geomancy.
An ordered binary arrangement of the hexagrams of the I Ching, representing the decimal sequence from 0 to 63, and a method for generating the same, was developed by the Chinese scholar and philosopher Shao Yong in the 11th century. However, there is no evidence that Shao understood binary computation.
The modern binary number system was fully documented by Gottfried Leibniz in the 18th century in his article Explication de l'Arithmétique Binaire. Leibniz's system used 0 and 1, like the modern binary numeral system.
In 1854, British mathematician George Boole published a landmark paper detailing a system of logic that would become known as Boolean algebra. His logical system proved instrumental in the development of the binary system, particularly in its implementation in electronic circuitry.
In 1937, Claude Shannon produced his master's thesis at MIT that implemented Boolean algebra and binary arithmetic using electronic relays and switches for the first time in history. Entitled A Symbolic Analysis of Relay and Switching Circuits, Shannon's thesis essentially founded practical digital circuit design.
In November of 1937, George Stibitz, then working at Bell Labs, completed a relay-based computer he dubbed the "Model K" (for "Kitchen", where he had assembled it), which calculated using binary addition. Bell Labs thus authorized a full research program in late 1938 with Stibitz at the helm. Their Complex Number Computer, completed January 8, 1940, was able to calculate complex numbers. In a demonstration to the American Mathematical Society conference at Dartmouth College on September 11, 1940, Stibitz was able to send the Complex Number Calculator remote commands over telephone lines by a teletype. It was the first computing machine ever used remotely over a phone line. Some participants of the conference who witnessed the demonstration were John Von Neumann, John Mauchly, and Norbert Wiener, who wrote about it in his memoirs.
[edit]
Representation
A binary number can be represented by any sequence of bits (binary digits), which in turn may be represented by any mechanism capable of being in two mutually exclusive states. The following sequences of symbols could all be interpreted as the same binary numeric value:
1 0 1 0 0 1 1 0 1 0
| - | - - | | - | -
x o x o o x x o x o
y n y n n y y n y n
2006-06-20 01:17:50
·
answer #5
·
answered by patrick143 2
·
0⤊
0⤋
1's, zero's/// they can range in large scales such as
110001101001000111
2006-06-20 01:18:38
·
answer #7
·
answered by Gilbert G 3
·
0⤊
0⤋