Unrelated to the article but I ran across an interesting result recently that is related to AI (and the hype surrounding it): Let A be an agent and let S be a Turing machine deductive system. If A correctly understands S, then A can correctly deduce that S does not have A’s capability for solving halting problems. [1] One way to interpret this is that all existing AI systems are obviously halting computations simply…
Recursive neural networks are not necessarily halting when executed in arbitrary precision arithmetic.