Bogus answer because it misleadingly implies that there is something dubious about classical logic that can be seen from the example in question, but that is simply bogus. Also, it fails to answer the question.
I've adapted a definition from Wikipedia and that refers to $\Bbb{R}$, to the following finite setting.
Define a typical pseudo-random number generator (Pseudo RNG) $f$ on a typical machine with word size $w$ bits to be any function $f: \Bbb{Z}/{2^w} \to \Bbb{Z}/{2^w}$ such that:
$$\forall E \sub...
Hard to believe that questions like this were upvoted to heaven. I have no hope that we can close or even delete this , I just want to demonstrate what happened with posts that were already off-topic years ago.
@Feeds Self-deleted. Was this a trial to prove P=NP ?