Rickerism

When dealing with computer science, there are laws just as stringent as those of thermodynamics. For instance, the laws of thermodynamics tell us that a perpetual motion machine is impossible. Likewise, these laws tell us what is inherently possible and impossible in computer science.

• Turing’s First Law, or the Law of Algorithms. A Turing machine and, thus, a digital computer can execute any algorithm but it can only execute algorithms.
• Turing’s Second Law, or the Law of Inherent Compatibility. A Turing machine of enough complexity can emulate any other Turing machine. Any incompatibility between computers is self imposed and can be overcome.
• Gödel’s Law, or the Law of Incompleteness. A set of axioms can be consistent or complete, but it cannot be both. Based on this law, one can mathematically prove that there is no algorithm for creating algorithms.
• Miller’s Law, or the Law of Seven, Plus or Minus Two. All humans have inherent natural cognitive limitations on how much information they can process. Computers are useless if they exceed this limitation.

I discuss these laws and their implications in further detail in my paper Information and Warfare. I made this post because I referenced one of the laws yesterday and will undoubtedly refer to them again in the future.