Zuse and Fredkin led to a farther reaching version of this idea that is supported by the Ackermann function because it is mu-recursive but not primitive recursive.
Zuse and Fredkin led to a farther reaching version of this idea that is supported by the Ackermann function because it is mu-recursive but not primitive recursive. Selmer Bringsjord has written "The Narrational Case Against" it and Paolo Cotogno paired it with "Hypercomputation" in a 2003 article. It has been applied to the halting problem to show that since it cannot be computed by a Turing machine, it cannot be computed at all. For 10 points, identify this thesis that states that every effectively calculable function is generally recursive, the result of two namesake computer scientists.
Zuse and Fredkin led to a farther reaching version of this idea that is supported by the Ackermann function because it is mu-recursive but not primitive recursive.
{Church}-Turing thesis