You could argue that the process I lined out in how we solve problems in computation is also described in this picture:
Yeah I posted about a bit of nuance on this topic.
In computation a good approach is to determine whether a problem can be reduced or transformed into a simpler or known form. I took some notes about different P vs NP Hard problems and mapping them out. For example, if you have a specific problem, but you can translate the problem to a graph coloring problem, then do that translation, solve it in that domain, and then translate it back. The graph coloring problem is defined here:
https://en.wikipedia.org/wiki/Graph_coloring
Discussion
No replies yet.