A group of 4 of the worlds smartest white guys to write a proof the computer science view that P does not equal NP is, in "fact", wrong.
P (deterministic { i.e. finite }) problems = NP (non-deterministic i.e. infinite and random) problems.
So, it got me thinking...
If
- * * you agree that everything (i.e. the universe, God) is infinite
- * * you agree that sampling at an incredibility high rate is sufficient for reproduction
Then
P = NP
because
NP (infinite) is sampled so each slice is actually finite, and more than likely repeating, therefore deterministic or P.
