Computability is often defined in terms of recursive functions, recursively enumerable sets, recursive sets. Is the reason behind this – the following:
- a function that can be computed is a recursive function – ie. parts of such function can be simplified and substituted, and then again simplified, substituted, and so forth
? Is this the meaning behind various recursive tools? Like: $\lambda$-calculus, Markov-algorithms, formal languages.