Hard for humans easy for computer
Answers
Answer:
We often hear that what's hard for humans is easy for computers. But it turns out that many kinds of problems are exceedingly hard for computers to solve. This class of problems, known as NP-Complete (NPC), was independently discovered by Stephen Cook and Leonid Levin.
Answer:
We often hear that what’s hard for humans is easy for computers. But it turns out that many kinds of problems are exceedingly hard for computers to solve. This class of problems, known as NP-Complete (NPC), was independently discovered by Stephen Cook and Leonid Levin.
. If at the same time a human can still solve the problem, there are a few possible conclusions we can draw:
Something special about the particular problem makes it easy for a computer to solve. While, in general, NPC problems are hard for computers to solve, certain sub groups happen to be easy. We want to avoid confusing the issue by accidentally picking a problem in that subgroup for the human to solve.
The human mind can access the special algorithm that can solve NPC problems.
The human mind operates on a non-physical plane.
To eliminate #1, we randomly pick our problem and run many, many tests. This achieves the level of scientific certainty.
Eliminating #2 is more tricky. But narrowing the scientific possibilities of explaining the human mind down to #2 and #3 is in itself a major achievement.
Alternatively, if we are unable to find any NPC problems that humans solve easily, then we can safely conclude the human mind is probably reducible to a computer program.