P=NP based reality layering concept
So regarding the question of P=NP, while not proven, it seems like it should be true in this segment of reality. The more important issue is: can an algorithm be found to find the applicable algorithm for any problem, quickly? Also, can the most important problem/answer for one's path be quickly identified at any given point, from the field of possible problem/answer combinations? If one could know both this algorithm for crafting algorithms, and be able to deduce the question of what they "should" be asking at any point, or what problem they should be solving, the "best fit path" through reality would be a straight line, without obstacles. To retain this ability indefinitely though might be impossible, and seems like it would at least would be undesirable, at least in our current state of reality.
Once the best fit solution has been achieved, it seems the same algorithm sourcing mechanism and important problem identifier could instead be combined to identify issues that cannot be solved with said algorithm in a vacuum (like that would be the next most desirable problem to solve in each case- identifying which problems could take the most time and complexity to solve, even with the algorithm sourcing mechanism and important solution finder that you have). It seems like this segment may not be clear until the initial best fit path and solution is resolved, like a layer of reality unseeable until this present layer can be solved optimally in its entirety.
Comments
Post a Comment