he power of computers is generally limited by a concept that computer scientists call noncomputability.58In short, certain types of problems cannot be solved by any computer program in any finite amount of time. There are many examples of noncomputable problems, but the most famous is Alan Turing’s “Halting Problem,” whichasks whether a given program will finish running (“halt”)