Innumeracy

P≠NP.

Stated simply, if this equation is true, then not all programming algorithms have a fast solution. This has great implications for fields like cryptography, since it more or less means there isn’t a simple ‘trick’ that can be used to break it.

A Rubik’s cube has 19.2 billion possible combinations, yet can be solved in 20 moves from any position.

Both instances which make this item very interesting.

I’m sure that there’s something to them, yet must admit, I simply don’t have the capacity to validate any of them empirically. Meanwhile? Conservapedia is attacking the theory of relativity as a liberal plot.

Consequently? I don’t feel as bad about not being able to understand these things.

Comments are closed.
%d bloggers like this: