The full gallery is here. I still have many more photos to process, so more is to come.
SAT is (not) NP-complete
Here is a easy-to-understand for this:
Let L be the Prolog program:
The Prolog system answers two different contradictory answers:
"Yes" = "1" and "0.9" in the fact.
Try the goal:
Again, the system answers two contradictory answers:"No" = "0" and "0.9".
Clearly, this language is in P, but how to reduce it to SAT?
How to reduce instances of the FLP problem whose output is two contradictory truth values to the SAT problem whose output is only one.
It is easy to show that ZFC is inconsistent via 2 (independent) proofs.
126.96.36.199, does your crankery have anything to do with sightseeing in the Netherlands?
Posted by mistake.
I deeply apologize.
Never mind the proof of SAT being (not) NP-complete would render ZFC inconsistent which may indirectly affect lots of things; not just sight-seeing in the Netherlands.
Review the paper, it has several proofs, none of which is about the mathematical foundations of sight-seeing.
Please accept my apologies again.