Is There a Simple Solution to All Complicated Problems?

  • Thread starter Thread starter magpies
  • Start date Start date
  • Tags Tags
    Complete
AI Thread Summary
The discussion centers on the distinction between simple and complicated problems, questioning whether "hard" problems can have simple answers. It posits that all problems can be perceived as hard when encountered for the first time, yet become easy with familiarity. The conversation suggests that if a simple solution is found for one complicated problem, it could imply that all complicated problems might have simple solutions, referencing the Cook–Levin theorem related to NP-completeness. There is a critique of current problem-solving methods, arguing that reliance on established solutions without understanding their derivation may hinder progress. The notion that complexity theory is often misunderstood is also highlighted, emphasizing that it pertains to computational efficiency rather than the subjective complexity of problems. The discussion concludes with a mention of the traveling salesman problem as an example of a hard problem in computational theory.
magpies
Messages
177
Reaction score
2
Ok basicaly it boils down to this... Two types of problems exist, simple problems and complicated problems. The current question is do the "hard" problems have a simple answer.

Ok so here is my take on this question. All problems are "hard" problems in the fact that if you run into a problem that you have not seen before it will be hard to find the solution. But also all problems are also "easy" problems in the fact that when you run into a type of problem you have done before it will be easy for you to find the solution. So what am I trying to say? Well the question is basicaly if we can find a simple answer to one of the complicated questions then all complicated questions will have simple answers. I think this is true. I think what we lose site of is the fact that the simple problems we have today where not always simple and a lot of work went into solving them. Also I would like to note that we have never been so good at solving problems that we did not need to show our work when solving them. This seems to suggest to me that while at the same time we are forgetting that all problems are simple in nature. We also have forgotten that all problems are complex or NP complete in other words. And the only reason we can solve any problems at all is because we did the slow work of putting the puzzle together to get to that point.

Now it seems to me that we are possibly making a mistake in our way of solving problems. If the goal is to be able to solve problems without having to do the work required for solving them then we will at some point need to change our methods of learning how to solve them. Because after 4000 years of advancement we are basicaly right where we left off putting 1 and 1 together. If it is not possible to just get the answer without doing the work then I suppose we will have to be ok with that but if it is possible we should not waste time by not even being wrong by not even trying to figure it out.
 
Physics news on Phys.org
It looks like someone just discovered complexity theory :)

What you said about "complex problems", that if there is an easy solution for one of them then all complicated questions will have simple answers is true. I think you're talking about the Cook–Levin theorem. If any NP complete problems are in P, then all of them are, and P = NP.
 
Nonono, you got it all wrong. Two types of problems exist, computable problems and non-computable problems!

In any case, complexity theory doesn't mean "hard" or "complex" in the way humans use the word every day. It specifically refers to "how fast" (polynomial time?) a non-deterministic turing machine can solve a decision problem.
 
magpies said:
Ok basicaly it boils down to this... Two types of problems exist, simple problems and complicated problems. The current question is do the "hard" problems have a simple answer.

Ok so here is my take on this question. All problems are "hard" problems in the fact that if you run into a problem that you have not seen before it will be hard to find the solution. But also all problems are also "easy" problems in the fact that when you run into a type of problem you have done before it will be easy for you to find the solution. So what am I trying to say? Well the question is basicaly if we can find a simple answer to one of the complicated questions then all complicated questions will have simple answers. I think this is true. I think what we lose site of is the fact that the simple problems we have today where not always simple and a lot of work went into solving them. Also I would like to note that we have never been so good at solving problems that we did not need to show our work when solving them. This seems to suggest to me that while at the same time we are forgetting that all problems are simple in nature. We also have forgotten that all problems are complex or NP complete in other words. And the only reason we can solve any problems at all is because we did the slow work of putting the puzzle together to get to that point.

Now it seems to me that we are possibly making a mistake in our way of solving problems. If the goal is to be able to solve problems without having to do the work required for solving them then we will at some point need to change our methods of learning how to solve them. Because after 4000 years of advancement we are basicaly right where we left off putting 1 and 1 together. If it is not possible to just get the answer without doing the work then I suppose we will have to be ok with that but if it is possible we should not waste time by not even being wrong by not even trying to figure it out.

If you want to see a hard problem, look up the traveling salesmen problem.
 
Similar to the 2024 thread, here I start the 2025 thread. As always it is getting increasingly difficult to predict, so I will make a list based on other article predictions. You can also leave your prediction here. Here are the predictions of 2024 that did not make it: Peter Shor, David Deutsch and all the rest of the quantum computing community (various sources) Pablo Jarrillo Herrero, Allan McDonald and Rafi Bistritzer for magic angle in twisted graphene (various sources) Christoph...
Thread 'My experience as a hostage'
I believe it was the summer of 2001 that I made a trip to Peru for my work. I was a private contractor doing automation engineering and programming for various companies, including Frito Lay. Frito had purchased a snack food plant near Lima, Peru, and sent me down to oversee the upgrades to the systems and the startup. Peru was still suffering the ills of a recent civil war and I knew it was dicey, but the money was too good to pass up. It was a long trip to Lima; about 14 hours of airtime...

Similar threads

Replies
1
Views
740
Replies
4
Views
1K
Replies
2
Views
1K
Replies
41
Views
4K
Replies
4
Views
1K
Back
Top