From charlesreid1

(Created page with "=Estimating Bits and Bytes= Via [https://www.youtube.com/watch?v=EKWGGDXe5MA Richard Feynman's Computing Heuristics lecture on Youtube] the following extremely useful relati...")
 
Line 3: Line 3:
Via [https://www.youtube.com/watch?v=EKWGGDXe5MA Richard Feynman's Computing Heuristics lecture on Youtube]
Via [https://www.youtube.com/watch?v=EKWGGDXe5MA Richard Feynman's Computing Heuristics lecture on Youtube]


the following extremely useful relation, specified in [https://en.wikipedia.org/wiki/IEEE_1541-2002 IEEE 1541-2002]
The following extremely useful relation, specified in [https://en.wikipedia.org/wiki/IEEE_1541-2002 IEEE 1541-2002]


Powers of 2^10 (1024) are very close to powers of 1000.
<pre>
      2^0 =                      1 ~ 1000^0
[kibi] 2^10 =                  1024 ~ 1000^1
[mebi] 2^20 =                1048576 ~ 1000^2
[gibi] 2^30 =            1073741824 ~ 1000^3
[tebi] 2^40 =          1099511627776 ~ 1000^4
[pebi] 2^50 =      1125899906842624 ~ 1000^5
[exbi] 2^60 =    1152921504606846976 ~ 1000^6
</pre>
=Flags=


{{AlgorithmComplexityFlag}}
{{AlgorithmComplexityFlag}}

Revision as of 07:11, 29 May 2017

Estimating Bits and Bytes

Via Richard Feynman's Computing Heuristics lecture on Youtube

The following extremely useful relation, specified in IEEE 1541-2002

Powers of 2^10 (1024) are very close to powers of 1000.

      2^0 =                      1 ~ 1000^0
[kibi] 2^10 =                   1024 ~ 1000^1
[mebi] 2^20 =                1048576 ~ 1000^2
[gibi] 2^30 =             1073741824 ~ 1000^3
[tebi] 2^40 =          1099511627776 ~ 1000^4
[pebi] 2^50 =       1125899906842624 ~ 1000^5
[exbi] 2^60 =    1152921504606846976 ~ 1000^6


Flags





See also: