Abstract

Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit computational power much greater than that of Turing machines . The fact is that they do not have such power. Although they decide the classical halting problem of Turing machines, they otherwise have almost the same limitations of Turing machines