> It's a slow and costly process, but it gets the job done and it made me wonder if there are algorithms like that, that can compute results otherwise uncomputa

> It's a slow and costly process, but it gets the job done and it made me wonder if there are algorithms like that, that can compute results otherwise uncomputable The catch with certain classes (maybe/probably all? disclaimer: am not theoretical computer scientist/mathematician) of uncomputable problems is that they are such that there is no notion of "getting closer" to the solution that's analogous to traversing the desert to a known location. There is no way to verify whether the next incremental step is taking you closer to or farther from the solution because calculating such is essentially the same problem as the root problem. See https://en.wikipedia.org/wiki/Undecidable_problem https://en.wikipedia.org/wiki/Undecidable_problem