3 ms·
Now we're getting somewhere. Since we're talking about specific mathematical operations, that suggests you have a formal mathematical expression of the problem,
by JellyBeanThief 4y ago
Now we're getting somewhere. Since we're talking about specific mathematical operations, that suggests you have a formal mathematical expression of the problem, and an algorithm to solve it, so that we can prove how its time complexity grows.
I would like to see the formal description of the problem and the algorithm.
- MichaelZuo 4y agoIt doesn't follow that knowing the big O complexity of a problem would imply knowing an 'algorithm to solve it' too. There are many known problems that do not have known solutions.
- JellyBeanThief 4y agoThat's fair. Then I'll just take the problem specification. What I want to get around is hand-wave claims that it's too complicated for anyone to figure it out. Because if no one has a formal statement of the problem, then that tells me that people are just making unfounded assumptions.
- MichaelZuo 4y agoIt doesn't follow that knowing the big O complexity of a problem would imply knowing a 'problem specification' either. In fact there are unresolved problems in computer science without what you imagine to be the case.