コンピューターの原理に関する英語原文
投稿者: japancockroach 投稿日時: 2005/01/07 23:48 投稿番号: [20976 / 66577]
>世界で最初の真空管のコンピュータが10進法で出来ていたのなら、その原理は10進法でしょ。わかるかな、当たり前のことなんだけど。
ジャー、どーして貴方はコンピュータの原理が2進数だって断定できるの?? 2進数でない10進数のコンピュータがあるわけでしょ。わかる。この簡単な反例。<
Computer Basics
A computer works with numbers based on two. The reason for this is that it is easy to represent two states, using a voltage which is either on or off. Off is called ‘Logic Zero’ and On is called ‘Logic One’.
This ‘Base 2’ numbering system is called ‘Binary’. The smallest digit is the ‘Binary Digit’ or ‘Bit’.
Back in the real world, we still need our decimal numbers, so by grouping bits together, it is possible to persuade computers to work in decimal. Each bit added to the group multiplies the the number of combinations possible by a factor of two. When eight bits are grouped, this is referred to as a ‘Byte’
To calculate how many combinations are possible in binary, raise 2 to the power of the number of bits, or: 2 times 2 times 2 times 2..... Repeated for the number of bits required. ‘To the power of’ may be written using the ‘caret’ symbol “^”, e.g. 2^3 = 2x2x2 (=8).
To put what I have just said into words, a byte has eight bits, so that gives: 2^8; This gives a result of 256 combinations. Try it on a calculator: 2x2x2x2x2x2x2x2 = 256. A nibble (4 bits) = 16.
BIN DEC HEX
0000 0 0h
0001 1 1h
0010 2 2h
0011 3 3h
0100 4 4h
0101 5 5h
0110 6 6h
0111 7 7h
1000 8 8h
1001 9 9h
1010 10 Ah
1011 11 Bh
1100 12 Ch
1101 13 Dh
1110 14 Eh
1111 15 Fh
ジャー、どーして貴方はコンピュータの原理が2進数だって断定できるの?? 2進数でない10進数のコンピュータがあるわけでしょ。わかる。この簡単な反例。<
Computer Basics
A computer works with numbers based on two. The reason for this is that it is easy to represent two states, using a voltage which is either on or off. Off is called ‘Logic Zero’ and On is called ‘Logic One’.
This ‘Base 2’ numbering system is called ‘Binary’. The smallest digit is the ‘Binary Digit’ or ‘Bit’.
Back in the real world, we still need our decimal numbers, so by grouping bits together, it is possible to persuade computers to work in decimal. Each bit added to the group multiplies the the number of combinations possible by a factor of two. When eight bits are grouped, this is referred to as a ‘Byte’
To calculate how many combinations are possible in binary, raise 2 to the power of the number of bits, or: 2 times 2 times 2 times 2..... Repeated for the number of bits required. ‘To the power of’ may be written using the ‘caret’ symbol “^”, e.g. 2^3 = 2x2x2 (=8).
To put what I have just said into words, a byte has eight bits, so that gives: 2^8; This gives a result of 256 combinations. Try it on a calculator: 2x2x2x2x2x2x2x2 = 256. A nibble (4 bits) = 16.
BIN DEC HEX
0000 0 0h
0001 1 1h
0010 2 2h
0011 3 3h
0100 4 4h
0101 5 5h
0110 6 6h
0111 7 7h
1000 8 8h
1001 9 9h
1010 10 Ah
1011 11 Bh
1100 12 Ch
1101 13 Dh
1110 14 Eh
1111 15 Fh
これは メッセージ 20953 (hpdellapple さん)への返信です.
固定リンク:https://yarchive.emmanuelc.dix.asia/552019566/cf9q_1/20976.html