Got it! This site "creationpie.com" uses cookies. You consent to this by clicking on "Got it!" or by continuing to use this website. Note: This appears on each machine/browser from which this site is accessed.
The amount of information that can be represented with bits can be eye-opening. Here are some graphical examples.
2. 80 bits
8 rows x 10 cols = 80 bits
It would take about 40,000,000,000 years (i.e., 40 billion years, or 40,000 million years) at 1,000,000 variations a second, never trying the same one more than once, to try every possible bit combination of 80 bits.
To do 1,000,000,000 (1 billion) variations a second, add 10 more bits for a total of 90 bits.
To require 40,000,000,000,000 (i.e., 40 trillion) years, add 10 more bits for a total of 100 bits.
About 60 bits are needed to identify any second in 40 billion years.
3. Program correctness
It is well known that, in general, one cannot test computer programs to insure that they are correct.
It is impossible to test be enumeration (i.e., checking all possibilities) whether a 64 bit processor can multiply two 64 bit integers. Testing would require 128 bits of test cases, or more than 1,000,000,000,000,000,000,000,000,000,000,000,000 possibilities.
How are programs proven correct?
Programs such as the multiplication problem are proven correct by using mathematics and a divide-and-conquer technique (specifically structural induction). That requires intelligence!
4. Problem solving
Any model that attempts to explain how information can arise by chance cannot assume intelligence as that is what is to be explained.
This is called "begging the question" (a mistranslation of "assuming the initial point").
Note that any model that attributes the origin of information and/or intelligence to "space aliens" cannot be true unless the "space aliens" are outside of space and time. The other explanation is that the Creator must be outside of space and time.
This conclusion follows from the same structural induction arguments related to Godel's incompleteness theorem.
5. Universe in 270 bits
10 rows x 27 cols = 270 bits
About 270 bits provide a unique identification code for each small particle in the known universe, estimated to have about 1080 particles.
Thus, 300 bits can identify each particle in 1,000,000,000 (1 billion) universes.
RFID (Radio Frequency Identification) tags, with 512 bits, can identify each particle in the known universe.
6. 400 bits
15 rows x 27 cols = 405 bits
So, to enumerate every bit combination for 400 bits would require that each small particle in 1,000,000,000 (1 billion) universes represent a computer that goes through 1,000,000,000 (1 billion) bit combinations a second for 40,000,000,000,000 (40 trillion years) without ever trying the same bit combination more than once.
